Analytic solutions of integral moving least squares for polygon soups

Taejung Park, Sung Ho Lee, Chang-Hun Kim

Research output: Contribution to journalArticle

5 Citations (Scopus)

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.

Original languageEnglish
Article number6104041
Pages (from-to)1638-1649
Number of pages12
JournalIEEE Transactions on Visualization and Computer Graphics
Volume18
Issue number10
DOIs
Publication statusPublished - 2012 Aug 30

Fingerprint

Least-Squares Analysis
Computational efficiency
Interpolation

Keywords

  • analytic integral solutions
  • Boundary representations
  • implicit surfaces
  • integral moving least squares
  • polygon soups

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Computer Vision and Pattern Recognition
  • Signal Processing

Cite this

Analytic solutions of integral moving least squares for polygon soups. / Park, Taejung; Lee, Sung Ho; Kim, Chang-Hun.

In: IEEE Transactions on Visualization and Computer Graphics, Vol. 18, No. 10, 6104041, 30.08.2012, p. 1638-1649.

Research output: Contribution to journalArticle

@article{2cbf1def2c6d4c17894a0e60195f04b2,
title = "Analytic solutions of integral moving least squares for polygon soups",
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.",
keywords = "analytic integral solutions, Boundary representations, implicit surfaces, integral moving least squares, polygon soups",
author = "Taejung Park and Lee, {Sung Ho} and Chang-Hun Kim",
year = "2012",
month = "8",
day = "30",
doi = "10.1109/TVCG.2011.286",
language = "English",
volume = "18",
pages = "1638--1649",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",
number = "10",

}

TY - JOUR

T1 - Analytic solutions of integral moving least squares for polygon soups

AU - Park, Taejung

AU - Lee, Sung Ho

AU - Kim, Chang-Hun

PY - 2012/8/30

Y1 - 2012/8/30

N2 - 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.

AB - 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.

KW - analytic integral solutions

KW - Boundary representations

KW - implicit surfaces

KW - integral moving least squares

KW - polygon soups

UR - http://www.scopus.com/inward/record.url?scp=84865387595&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84865387595&partnerID=8YFLogxK

U2 - 10.1109/TVCG.2011.286

DO - 10.1109/TVCG.2011.286

M3 - Article

AN - SCOPUS:84865387595

VL - 18

SP - 1638

EP - 1649

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 10

M1 - 6104041

ER -