| Unconstrained isosurface extraction on arbitrary octrees |
| Full text |
Publisher Site
|
| Source
|
ACM International Conference Proceeding Series; Vol. 257
archive
Proceedings of the fifth Eurographics symposium on Geometry processing
table of contents
Barcelona, Spain
SESSION: Meshing and parameterization
table of contents
Pages: 125 - 133
Year of Publication: 2007
ISBN ~ ISSN:1727-8384 , 978-3-905673-46-3
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
Eurographics Association
Aire-la-Ville, Switzerland, Switzerland
|
| Bibliometrics |
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 0
|
|
|
ABSTRACT
This paper presents a novel algorithm for generating a watertight level-set from an octree. We show that the levelset 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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
|
| |
3
|
|
| |
4
|
|
| |
5
|
{HWC*05} Ho C., Wu F., Chen B., Chuang Y., Ouhyoung M.: Cubical marching squares: Adaptive feature preserving surface extraction from volume data. In Proceedings of EUROGRAPHICS 2005 (2005), pp. 537--545.
|
 |
6
|
|
| |
7
|
{JU06} Ju T., Udeshi T.: Intersection-free contouring of an octree grid. In Proceedings of Pacific Graphics (2006).
|
| |
8
|
|
 |
9
|
|
 |
10
|
|
 |
11
|
|
| |
12
|
|
| |
13
|
{MY80} Meeks W., Yau S.: Topology of three dimensional manifolds and the embedding problems in minimal surface theory. The Annals of Mathematics 112, 3 (November 1980), 441--484.
|
| |
14
|
{MY82} Meeks W., Yau S.: The existence of embedded minimal surfaces and the problem of uniqueness. Mathematische Zeitschrift 179, 2 (June 1982), 151--168.
|
| |
15
|
|
 |
16
|
|
| |
17
|
|
| |
18
|
Raj Shekhar , Elias Fayyad , Roni Yagel , J. Fredrick Cornhill, Octree-based decimation of marching cubes surfaces, Proceedings of the 7th conference on Visualization '96, p.335-ff., October 28-29, 1996, San Francisco, California, United States
|
| |
19
|
|
| |
20
|
|
| |
21
|
{SZK95} Shu R., Zhou C., Kankanhalli M.: Adaptive marching cubes. The Visual Computer 11 (1995), 202--217.
|
 |
22
|
|
| |
23
|
Gokul Varadhan , Shankar Krishnan , Liangjun Zhang , Dinesh Manocha, Reliable implicit surface polygonization using visibility mapping, Proceedings of the fourth Eurographics symposium on Geometry processing, June 26-28, 2006, Cagliari, Sardinia, Italy
|
 |
24
|
|
| |
25
|
{WKE99} Westermann R., Kobbelt L., Ertl T.: Real-time exploration of regular volume data by adaptive reconstruction of isosurfaces. The Visual Computer 15 (1999), 100--111.
|
| |
26
|
{WMW86} Wyvill G., McPheeters C., Wyvill B.: Data structures for soft objects. The Visual Computer 2 (1986), 227--234.
|
|