Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Introduction to algorithms
A volumetric method for building complex models from range images
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Controlled simplification of genus for polygonal models
VIS '97 Proceedings of the 8th conference on Visualization '97
Contour trees and small seed sets for isosurface traversal
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Construction of contour trees in 3D in O(n log n) steps
Proceedings of the fourteenth annual symposium on Computational geometry
MAPS: multiresolution adaptive parameterization of surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Real time compression of triangle mesh connectivity
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
SIAM Review
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Topology preserving and controlled topology simplifying multiresolution isosurface extraction
Proceedings of the conference on Visualization '00
Isosurfacing in higher dimensions
Proceedings of the conference on Visualization '00
Texture mapping progressive meshes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Edgebreaker: a simple compression for surfaces with handles
Proceedings of the seventh ACM symposium on Solid modeling and applications
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
A three-dimensional holes closing algorithm
Pattern Recognition Letters
Efficient computation of the topology of level sets
Proceedings of the conference on Visualization '02
Computing contour trees in all dimensions
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
The flow complex: a data structure for geometric modeling
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
GRIN'01 No description on Graphics interface 2001
Topological persistence and simplification
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Fast Surface Reconstruction Using the Level Set Method
VLSM '01 Proceedings of the IEEE Workshop on Variational and Level Set Methods (VLSM'01)
Removing excess topology from isosurfaces
ACM Transactions on Graphics (TOG)
Dual Contouring with Topology-Preserving Simplification Using Enhanced Cell Representation
VIS '04 Proceedings of the conference on Visualization '04
Tightening: curvature-limiting morphological simplification
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Mason: morphological simplification
Graphical Models
IEEE Transactions on Visualization and Computer Graphics
Topology Repair of Solid Models Using Skeletons
IEEE Transactions on Visualization and Computer Graphics
Editing the topology of 3D models by sketching
ACM SIGGRAPH 2007 papers
Topology correction of segmented medical images using a fast marching algorithm
Computer Methods and Programs in Biomedicine
Topologically Clean Distance Fields
IEEE Transactions on Visualization and Computer Graphics
Topological Repairing of 3D Digital Images
Journal of Mathematical Imaging and Vision
Topology correction using fast marching methods and its application to brain segmentation
MICCAI'05 Proceedings of the 8th international conference on Medical image computing and computer-assisted intervention - Volume Part II
Polygon mesh repairing: An application perspective
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
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 iso-surface 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.