Robust multi-level partition of unity implicits from triangular meshes
Weitao Li, Yuanfeng Zhou, Caiming Zhang, Xuemei Li
In Computer Animation and Virtual Worlds, 25(2), 2014.
Abstract: 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.
Keyword(s): MPU, approximation, dual graph, polygon–implicit error metric
Article URL: http://dx.doi.org/10.1002/cav.1536
BibTeX format:
@article{Li:2014:RMP,
  author = {Weitao Li and Yuanfeng Zhou and Caiming Zhang and Xuemei Li},
  title = {Robust multi-level partition of unity implicits from triangular meshes},
  journal = {Computer Animation and Virtual Worlds},
  volume = {25},
  number = {2},
  pages = {115--127},
  year = {2014},
}
Search for more articles by Weitao Li.
Search for more articles by Yuanfeng Zhou.
Search for more articles by Caiming Zhang.
Search for more articles by Xuemei Li.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."