Multiresolution Volume Simplification and Polygonization
Loading...
Date
2003
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
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.
Description
@inproceedings{:10.2312/VG/VG03/087-094,
booktitle = {Volume Graphics},
editor = {I. Fujishiro and K. Mueller and A. Kaufman},
title = {{Multiresolution Volume Simplification and Polygonization}},
author = {Zhang, Nan and Kaufman, Arie},
year = {2003},
publisher = {The Eurographics Association},
ISSN = {1727-8376},
ISBN = {1-58113-745-1},
DOI = {/10.2312/VG/VG03/087-094}
}