Premium
Robust multi‐level partition of unity implicits from triangular meshes
Author(s) -
Li Weitao,
Zhou Yuanfeng,
Zhang Caiming,
Li Xuemei
Publication year - 2013
Publication title -
computer animation and virtual worlds
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.225
H-Index - 49
eISSN - 1546-427X
pISSN - 1546-4261
DOI - 10.1002/cav.1536
Subject(s) - polygon mesh , quadric , triangle mesh , partition (number theory) , surface (topology) , computer science , metric (unit) , graph , mesh generation , mathematics , algorithm , combinatorics , geometry , theoretical computer science , finite element method , computer graphics (images) , operations management , economics , physics , thermodynamics
This paper presents a new robust multi‐level partition of unity (MPU) method, which constructs an implicit surface from a triangular mesh via the new error metric between the mesh and the implicit surface. The new error metric employs a weighted function of inner points and vertices of a triangle to fit an implicit surface, which can control the approximation error between the surface and vertices of the triangle. Furthermore, it is applied to the MPU method by utilizing the dual graph of a triangular mesh, and the general quadric implicit surface is used for surface representation. Compared with the MPU method, the new method generates fewer subdivision cells with the same approximation error and performs more steadily especially when given triangular mesh with fewer vertices. Copyright © 2013 John Wiley & Sons, Ltd.