Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Using distance maps for accurate surface representation in sampled volumes
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
Out-of-core simplification of large polygonal models
Proceedings of the 27th 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
Dual contouring of hermite data
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
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
Feature preserving manifold mesh from an octree
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Robust repair of polygonal models
ACM SIGGRAPH 2004 Papers
Dual Marching Cubes: Primal Contouring of Dual Grids
PG '04 Proceedings of the Computer Graphics and Applications, 12th Pacific Conference
VIS '04 Proceedings of the conference on Visualization '04
Dual Contouring with Topology-Preserving Simplification Using Enhanced Cell Representation
VIS '04 Proceedings of the conference on Visualization '04
Efficient representation and extraction of 2-manifold isosurfaces using kd-trees
Graphical Models - Special issue on pacific graphics 2003
Feature-Sensitive Subdivision and Isosurface Reconstruction
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
IEEE Transactions on Visualization and Computer Graphics
Delaunay refinement for piecewise smooth complexes
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Feature-Preserving Reconstruction of Singular Surfaces
Computer Graphics Forum
| Hi-index | 0.00 |
A number of papers present algorithms to construct isosurfaces with sharp edges and corners from hermite data, i.e. the exact surface normals at the exact intersection of the surface and grid edges. We discuss some fundamental problems with the previous algorithms and describe a new approach, based on merging grid cubes near sharp edges, that produces significantly better results. Our algorithm requires only gradients at the grid vertices, not at each surface-edge intersection point. We also give a method for measuring the correctness of the resulting sharp edges and corners in the isosurface.