| Nonobtuse Meshes with Guaranteed Angle Bounds Contributor(s): Li, John Yung San (Author) |
|
 |
ISBN: 3836487888 ISBN-13: 9783836487887 Publisher: VDM Verlag Dr. Mueller E.K. OUR PRICE: $50.27 Product Type: Paperback Published: April 2008 Annotation: High-quality mesh representations of 3D objects are useful in many applications ranging from computer graphics to mathematical simulation. We present a novel method to generate triangular meshes with a guaranteed face angle bound of [30, 90]. The strategy is to first remesh a 2-manifold, open or closed, mesh into a rough approximate mesh that respects the proposed angle bounds. This is achieved by a novel extension to the Marching Cubes algorithm. Next, we perform an iterative constrained optimization, along with constrained Laplacian smoothing, to arrive at a close approximation of the input mesh. A constrained mesh decimation algorithm is then carried out to produce a hierarchy of coarse meshes where the angle bounds are maintained. We demonstrate the quality of our work through several examples. |
| Additional Information |
| BISAC Categories: - Computers | Computer Graphics |
| Physical Information: 0.21" H x 6" W x 9" (0.32 lbs) 100 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: High-quality mesh representations of 3D objects are useful in many applications ranging from computer graphics to mathematical simulation. We present a novel method to generate triangular meshes with a guaranteed face angle bound of 30, 90]. The strategy is to first remesh a 2-manifold, open or closed, mesh into a rough approximate mesh that respects the proposed angle bounds. This is achieved by a novel extension to the Marching Cubes algorithm. Next, we perform an iterative constrained optimization, along with constrained Laplacian smoothing, to arrive at a close approximation of the input mesh. A constrained mesh decimation algorithm is then carried out to produce a hierarchy of coarse meshes where the angle bounds are maintained. We demonstrate the quality of our work through several examples. |
