Nonobtuse Remeshing and Mesh Decimation

Li, J. Y. S.; Zhang, H.

Nonobtuse Remeshing and Mesh Decimation

Files

235-238.pdf (170.84 KB)

Date

2006

Authors

Li, J. Y. S.
Zhang, H.

Publisher

The Eurographics Association

Abstract

Quality meshing in 2D and 3D domains is an important problem in geometric modeling and scientific computing. We are concerned with triangle meshes having only nonobtuse angles. Specifically, we propose a solution for guaranteed nonobtuse remeshing and nonobtuse mesh decimation. Our strategy for the remeshing problem is to first convert an input mesh, using a modified Marching Cubes algorithm, into a rough approximate mesh that is guaranteed to be nonobtuse. We then apply iterative "deform-to-fit" via constrained optimization to obtain a high-quality approximation, where the search space is restricted to be the set of nonobtuse meshes having a fixed connectivity. With a detailed nonobtuse mesh in hand, we apply constrained optimization again, driven by a quadric-based error, to obtain a hierarchy of nonobtuse meshes via mesh decimation.

        @inproceedings{:10.2312/SGP/SGP06/235-238
,
booktitle = {Symposium on Geometry Processing
},
editor = {Alla Sheffer and Konrad Polthier
},
title = {{Nonobtuse Remeshing and Mesh Decimation
}},
author = {Li, J. Y. S. and 
Zhang, H.
},
year = {2006
},
publisher = {The Eurographics Association
},
ISSN = {1727-8384
},
ISBN = {3-905673-24-X
},
DOI = {/10.2312/SGP/SGP06/235-238
}
}