Figure 1: Buddhas of increasing genus. First, the two handles formed by the arms are created, then one on the bottom and, finally, two on the sides. There are numerous algorithms in graphics and visualization whose performance is known to decay as the topological complexity of the input increases. On the other hand, the standard pipeline for 3D geometry acquisition often produces 3D models that are topologically more complex than their real forms. We present a simple and efficient algorithm that allows us to simplify the topology of an isosurface by altering the values of some number of voxels. Its utility and performance are demonstrated on several examples, including signed distance functions from polygonal models and CT scans. I.3.5 [Computing Methodologies]: Computer Graphics—
|
5825
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 1992
|
|
691
|
The laplacian pyramid as a compact image coder
– Burt, Adelson
- 1983
|
|
503
|
A volumetric method for building complex models from range images
– Curless, Levoy
- 1996
|
|
237
|
Triangle Mesh Compression
– Touma, Gotsman
- 1998
|
|
195
|
Morse Theory
– Milnor
- 1963
|
|
159
|
Real Time Compression of Triangle Mesh Connectivity
– Gumhold, Strasser
- 1998
|
|
157
|
Marching cubes: a high resolution 3d surface reconstruction algorithm
– Lorensen, Cline
- 1987
|
|
143
|
D.: Maps: Multiresolution adaptive parameterization of surfaces
– Lee, Sweldens, et al.
- 1998
|
|
141
|
Geometry images
– Gu, Gortler, et al.
- 2002
|
|
118
|
Texture mapping progressive meshes
– Sander, Snyder, et al.
- 2001
|
|
84
|
Valence-driven connectivity encoding of 3d meshes
– Alliez, Desbrun
- 2001
|
|
76
|
Normal meshes
– Guskov, Vidimce, et al.
- 2000
|
|
75
|
Contour trees and small seed sets for iso-surface traversal
– KREVELD, OOSTRUM, et al.
- 1997
|
|
66
|
Fast marching methods
– Sethian
- 1999
|
|
64
|
Fast surface reconstruction using the level set method
– Zhao, Fedkiw
- 2001
|
|
61
|
Topological noise removal
– WOOD, GUSKOV
|
|
60
|
U.: Computing contour trees in all dimensions
– Carr, Snoeyink, et al.
- 2003
|
|
46
|
Topology preserving and controlled topology simplifying multiresolution isosurface extraction
– Gerstner, Pajarola
|
|
45
|
MESH: Measuring Errors between Surfaces using the Hausdorff
– Aspert, Santa-Cruz, et al.
- 2002
|
|
23
|
Surface reconstruction based on a dynamical system
– Giesen, John
- 2002
|
|
22
|
The flow complex: A data structure for geometric modeling
– Giesen, John
- 2003
|
|
22
|
K.: Efficient computation of the topology of level sets
– Pascucci, Cole-McLaughlin
- 2002
|
|
20
|
Iso-contouring in higher dimensions
– Bhaniramka, Wenger, et al.
- 2000
|
|
18
|
Morse theory for implicit surface modeling
– Hart
- 1998
|
|
17
|
Simplification and repair of polygonal models using volumetric techniques
– NOORUDDIN, TURK
- 1999
|
|
15
|
A course in simple–homotopy theory
– Cohen
- 1973
|
|
13
|
A topology preserving deformable model using level sets
– Han, Xu, et al.
- 2001
|
|
12
|
ZOMORODIAN A.: Topological persistence and simplification
– EDELSBRUNNER, LETSCHER
- 2000
|
|
12
|
Retinex image processing: Improved fidelity to direct visual observation
– JOBSON, RAHMAN, et al.
- 1995
|
|
10
|
Isosurface topology simplification
– Wood, Hoppe, et al.
- 2002
|
|
6
|
A topology preserving geometric deformable model and its application in brain cortical surface reconstruction
– Han, Xu, et al.
- 2003
|
|
5
|
On the dunce hat
– Zeeman
- 1964
|
|
3
|
A three-dimensional holes closing algorithm
– Aktouf, Bertrand, et al.
- 2002
|
|
3
|
Construction of contour trees in 3d in o(nlogn) steps
– TARASOV, VYALYI
- 1998
|
|
1
|
Surface reconstruction by wrpping finite point sets in space
– Edelsbrunner
|
|
1
|
Jarek Rossignac, Andrzej Szymczak, Alla Safanova, and Geovan Tavares. Edgebreaker: A simple algorithm for surfaces with handles
– Lopes
- 2002
|
