Shape reconstruction from planar cross sections
Computer Vision, Graphics, and Image Processing
Automatic reconstruction of surfaces and scalar fields from 3D scans
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Arbitrary topology shape reconstruction from planar cross sections
Graphical Models and Image Processing
Contour interpolation and surface reconstruction of smooth terrain models
Proceedings of the conference on Visualization '98
Improved constructions of Delaunay based contour surfaces
Proceedings of the fifth ACM symposium on Solid modeling and applications
Dihedral bounds for mesh generation in high dimensions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Quality Mesh Generation in Higher Dimensions
SIAM Journal on Computing
Journal of the ACM (JACM)
Optimal surface reconstruction from planar contours
Communications of the ACM
Reconstruction and simplification of surfaces from contours
Graphical Models - Pacific Graphics '99 in Graphical Models
Straight-skeleton based contour interpolation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
In this paper, we present the first nontrivial theoretical bound on the quality of the 3D solids generated by any contour interpolation method. Given two arbitrary parallel contour slices with n vertices in 3D, let α be the smallest angle in the constrained Delaunay triangulation of the corresponding 2D contour overlay, we present a contour interpolation method which reconstructs a 3D solid with the minimum dihedral angle of at least α/8. Our algorithm runs in O(nlogn) time where n is the size of the contour overlay.We also present a heuristic algorithm that optimizes the dihedral angles of a mesh representing a surface in 3D.