The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2012 vol. 18)
ISSN: 1077-2626
pp: 1638-1649
Chang-Hun Kim , Korea University, Seoul
Taejung Park , Korea University, Seoul
Sung-Ho Lee , Korea University, Seoul
ABSTRACT
This paper presents analytic solutions to the integral moving least squares (MLS) equations originally proposed by Shen et al. by choosing another specific weighting function that renders the numerator in the MLS equation unitless. In addition, we analyze the original method to show that their approximation surfaces (i.e., enveloping surfaces with nonzero \epsilon values in the weighting function) often form zero isosurfaces near concavities behind the triangle-soup models. This paper also presents error terms for the integral MLS formulations against signed distance fields. Based on our analytic solutions, we show that our method provides both interpolation and approximation surfaces faster and more efficiently. Because our method computes solutions for integral MLS equations directly, it does not rely on numerical steps that might have numerical-accuracy issues. In particular, unlike the original method that deals with incorrect approximation surfaces by iteratively adjusting parameters, this paper proposes faster and more efficient approximations to surfaces without needing iterative routines. We also present computational efficiency comparisons, in which our method is 15-fold faster in computing integrations, even with conservative assumptions. Finally, we show that the surface normal vectors on the implicit surfaces formed by our analytic solutions are identical to the angle-weighted pseudonormal vectors.
INDEX TERMS
Vectors, Least squares approximation, Mathematical model, Interpolation, Computational modeling, analytic integral solutions., Boundary representations, integral moving least squares, implicit surfaces, polygon soups
CITATION
Chang-Hun Kim, Taejung Park, Sung-Ho Lee, "Analytic Solutions of Integral Moving Least Squares for Polygon Soups", IEEE Transactions on Visualization & Computer Graphics, vol. 18, no. , pp. 1638-1649, Oct. 2012, doi:10.1109/TVCG.2011.286
163 ms
(Ver 3.1 (10032016))