Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Polygonization of implicit surfaces
Computer Aided Geometric Design
Octrees for faster isosurface generation
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Topological considerations in isosurface generation extended abstract
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Adaptive generation of surfaces in volume data
The Visual Computer: International Journal of Computer Graphics
A volumetric method for building complex models from range images
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Octree-based decimation of marching cubes surfaces
Proceedings of the 7th conference on Visualization '96
Using distance maps for accurate surface representation in sampled volumes
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
Adaptively sampled distance fields: a general representation of shape for computer graphics
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Out-of-core simplification of large polygonal models
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Multidimensional binary search trees used for associative searching
Communications of the ACM
Hierarchical face clustering on polygonal surfaces
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Semi-regular mesh extraction from volumes
Proceedings of the conference on Visualization '00
Kizamu: a system for sculpting digital characters
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Feature sensitive surface extraction from volume data
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Topology-reducing surface simplification using a discrete solid representation
ACM Transactions on Graphics (TOG)
Dual contouring of hermite data
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Efficient estimation of 3D Euclidean distance fields from 2D range images
VVS '02 Proceedings of the 2002 IEEE symposium on Volume visualization and graphics
A memory insensitive technique for large model simplification
Proceedings of the conference on Visualization '01
A Near Optimal Isosurface Extraction Algorithm Using the Span Space
IEEE Transactions on Visualization and Computer Graphics
Constrained Elastic Surface Nets: Generating Smooth Surfaces from Binary Segmented Data
MICCAI '98 Proceedings of the First International Conference on Medical Image Computing and Computer-Assisted Intervention
Removing excess topology from isosurfaces
ACM Transactions on Graphics (TOG)
IEEE Transactions on Visualization and Computer Graphics
Fixing geometric errors on polygonal models: a survey
Journal of Computer Science and Technology
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
A connected-component-labeling-based approach to virtual porosimetry
Graphical Models
Merging faces: a new orthogonal simplification of solid models
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Constructing isosurfaces with sharp edges and corners using cube merging
EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization
| Hi-index | 0.00 |
In this paper, we propose the utilization of a kd-tree based hierarchy as an implicit object representation. Compared to an octree, the kd-tree based hierarchy is superior in terms of adaptation to the object surface. In consequence, we obtain considerably more compact implicit representations especially in case of thin object structures. We describe a new isosurface extraction algorithm for this kind of implicit representation. In contrast to related algorithms for octrees, it generates 2-manifold meshes even for kd-trees with cells containing multiple surface components. The algorithm retains all the good properties of the Dual Contouring approach by Ju et al. [ACM Trans. Graphics 21 (2002) 339-346] like feature preservation, computational efficiency, etc. In addition, we present a simplification framework for the surfaces represented by the kd-tree based on quadric error metrics. We adapt this framework to quantify the influence of topological changes, thereby allowing controlled topological simplification of the object. The advantages of the new algorithm are demonstrated by several examples.