Unconstrained Isosurface Extraction on Arbitrary Octrees

Loading...
Thumbnail Image
Date
2007
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
This paper presents a novel algorithm for generating a watertight level-set from an octree. We show that the level- set can be efficiently extracted regardless of the topology of the octree or the values assigned to the vertices. The key idea behind our approach is the definition of a set of binary edge-trees derived from the octree s topology. We show that the edge-trees can be used define the positions of the isovalue-crossings in a consistent fashion and to resolve inconsistencies that may arise when a single edge has multiple isovalue-crossings. Using the edge-trees, we show that a provably watertight mesh can be extracted from the octree without necessitating the refinement of nodes or modification of their values.
Description

        
@inproceedings{
:10.2312/SGP/SGP07/125-133
, booktitle = {
Geometry Processing
}, editor = {
Alexander Belyaev and Michael Garland
}, title = {{
Unconstrained Isosurface Extraction on Arbitrary Octrees
}}, author = {
Kazhdan, Michael
and
Klein, Allison
and
Dalal, Ketan
and
Hoppe, Hugues
}, year = {
2007
}, publisher = {
The Eurographics Association
}, ISSN = {
1727-8384
}, ISBN = {
978-3-905673-46-3
}, DOI = {
/10.2312/SGP/SGP07/125-133
} }
Citation