A syntactic/semantic technique for surface reconstruction from cross-sectional contours
Computer Vision, Graphics, and Image Processing
ACM Transactions on Graphics (TOG)
Piecewise-linear interpolation between polygonal slices
Computer Vision and Image Understanding
Arbitrary topology shape reconstruction from planar cross sections
Graphical Models and Image Processing
Optimal surface reconstruction from planar contours
Communications of the ACM
Conforming Delaunay triangulations in 3D
Proceedings of the eighteenth annual symposium on Computational geometry
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity of the delaunay triangulation of points on surfaces the smooth case
Proceedings of the nineteenth annual symposium on Computational geometry
Reconstruction and Simplification of Surfaces from Contours
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
Reconstruction of human anatomical models from segmented contour lines
CIS'04 Proceedings of the First international conference on Computational and Information Science
Fast reconstruction of 3d terrain model from contour lines on 2d maps
AsiaSim'04 Proceedings of the Third Asian simulation conference on Systems Modeling and Simulation: theory and applications
| Hi-index | 0.00 |
In order to create three-dimensional terrain models, we reconstruct geometric models from contour lines on two-dimensional map. Previous methods divide a set of contour lines into simple matching regions and clefts. Since long processing time is taken for reconstructing clefts, performance might be degraded while manipulating complicated models. We propose a fast reconstruction method, which generates triangle strips by computing distance of corresponding vertex pairs in adjacent slices for simple matching region. If there are some branches or dissimilarities, it computes midpoints of corresponding vertices and reconstructs geometry of those areas by tiling the midpoints and remaining vertices. Experimental results show that our method reconstructs geometric models fairly well and it is faster than the previous method.