Multiresolution Volume Simplification and Polygonization
| dc.contributor.author | Zhang, Nan | en_US |
| dc.contributor.author | Kaufman, Arie | en_US |
| dc.contributor.editor | I. Fujishiro and K. Mueller and A. Kaufman | en_US |
| dc.date.accessioned | 2014-01-29T17:38:35Z | |
| dc.date.available | 2014-01-29T17:38:35Z | |
| dc.date.issued | 2003 | en_US |
| dc.description.abstract | We propose a multiresolution volume simplification and polygonization algorithm. Traditionally, voxel-based algorithms lack the adaptive resolution support and consequently simplified volumes quickly lose sharp features after several levels of downsampling, while tetrahedral-based simplification algorithms usually generate poorly shaped triangles. In our method, each boundary cell is represented by a carefully selected representative vertex. The quadric error metrics are applied as the geometric error metric. Our approach first builds an error pyramid by bottom-up cell merging. We avoid topology problems in hierarchical cell merging by disabling erroneous cells and penalizing cells containing disconnected surface components with additional costs. Then, a top-down traversal is used to collect cells within a user specified error threshold. The surfacenets algorithm is used to polygonize these cells. We enhance it with online triangle shape optimization and budget control. Finally, we discuss a novel octree implementation which greatly eases the polygonization operations. | en_US |
| dc.description.seriesinformation | Volume Graphics | en_US |
| dc.identifier.isbn | 1-58113-745-1 | en_US |
| dc.identifier.issn | 1727-8376 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/VG/VG03/087-094 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | Multiresolution Volume Simplification and Polygonization | en_US |