Skip to main content
Article thumbnail
Location of Repository

and Object Modeling

By John Y. S. Li and Hao Zhang


The problem of nonobtuse triangulation has been studied in the 2D domains, however, guaranteed nonobtuse remeshing of curve surfaces is still an open problem. Nonobtuse meshes are desirable in certain situations such as geodesic computations and planar mesh embedding. In this paper, we propose a solution to nonobtuse remeshing and nonobtuse decimation. Our approach utilizes a “deform-to-fit " strategy to solve the remeshing problem. We first construct an initial nonobtuse mesh, via a modified version of the Marching Cubes algorithm, that roughly approximates the input mesh. An iterative constrained optimization is then applied to obtain a high quality approximation of the input mesh. At each iteration, the constraints ensure the output mesh is guaranteed nonobtuse. By making use of quadric-based errors, we iteratively decimate the high-detail nonobtuse mesh in a similar constrained manner to obtain a hierarchy of nonobtuse meshes

Year: 2009
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.