| dc.contributor.author | Li, J. Y. S. | en_US |
| dc.contributor.author | Zhang, H. | en_US |
| dc.contributor.editor | Alla Sheffer and Konrad Polthier | en_US |
| dc.date.accessioned | 2014-01-29T08:14:09Z | |
| dc.date.available | 2014-01-29T08:14:09Z | |
| dc.date.issued | 2006 | en_US |
| dc.identifier.isbn | 3-905673-24-X | en_US |
| dc.identifier.issn | 1727-8384 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/SGP/SGP06/235-238 | en_US |
| dc.description.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. | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling | en_US |
| dc.title | Nonobtuse Remeshing and Mesh Decimation | en_US |
| dc.description.seriesinformation | Symposium on Geometry Processing | en_US |
