| dc.contributor.author | Kazhdan, Michael | en_US |
| dc.contributor.author | Klein, Allison | en_US |
| dc.contributor.author | Dalal, Ketan | en_US |
| dc.contributor.author | Hoppe, Hugues | en_US |
| dc.contributor.editor | Alexander Belyaev and Michael Garland | en_US |
| dc.date.accessioned | 2014-01-29T09:43:11Z | |
| dc.date.available | 2014-01-29T09:43:11Z | |
| dc.date.issued | 2007 | en_US |
| dc.identifier.isbn | 978-3-905673-46-3 | en_US |
| dc.identifier.issn | 1727-8384 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/SGP/SGP07/125-133 | en_US |
| dc.description.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. | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Boundary Representations | en_US |
| dc.title | Unconstrained Isosurface Extraction on Arbitrary Octrees | en_US |
| dc.description.seriesinformation | Geometry Processing | en_US |
