By Topic

Isotropic Mesh Simplification by Evolving the Geodesic Delaunay Triangulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Shi-Qing Xin ; Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore ; Shuang-Min Chen ; Ying He ; Guo-Jin Wang
more authors

In this paper, we present an intrinsic algorithm for isotropic mesh simplification. Starting with a set of unevenly distributed samples on the surface, our method computes the geodesic Delaunay triangulation with regard to the sample set and iteratively evolves the Delaunay triangulation such that the Delaunay edges become almost equal in length. Finally, our method outputs the simplified mesh by replacing each curved Delaunay edge with a line segment. We conduct experiments on numerous real-world models of complicated geometry and topology. The promising experimental results demonstrate that the proposed method is intrinsic and insensitive to initial mesh triangulation.

Published in:

Voronoi Diagrams in Science and Engineering (ISVD), 2011 Eighth International Symposium on

Date of Conference:

28-30 June 2011