Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cohen-Steiner, D., Colin de Verdiere, E., Yvinec, M.: Conforming Delaunay triangulations in 3D. In: Proceedings of 18th Symposium on Computational Geometry, pp. 199–208 (2002)
Attali, D., Boissonnat, J.D., Lieuter, A.: Complexity of the Delaunay Triangulation of points on surfaces. In: Proc. of 19th Annual ACM Symposium on Comput. Geometry, pp. 201–210 (2003)
Erickson, J.: Dense point sets have sparse Delaunay triangulations. In: Proceedings of 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 125–134 (2002)
Barequet, G., Sharir, M.: Piecewise-Linear Interpolation between Polygonal Slices. Computer Vision and Image Understanding 63(2), 251–272 (1996)
Barequet, G., Shapiro, D., Tal, A.: Multilevel Sensitive Reconstruction of Polyhedral Surfaces from Parallel Slices. The Visual Computer 16(2), 116–133 (2000)
Fuchs, H., Kedem, Z., Uselton, S.: Optimal Surface Reconstruction from Planar Contours. Communications of the ACM 20(10), 693–702 (1977)
Kehtarnavaz, N., Simar, L., Figueiredo, R.: A Syntactic/Semantic Technique for Surface Reconstruction from Cross-sectional Contours. In: CVGIP, vol. 42, pp. 399–409 (1988)
Klincsek, G.: Minimal Triangulations of Polygonal Domains. Annals of Discrete Mathematics 9, 121–123 (1980)
Bajaj, C., Coyle, E., Lin, K.: Arbitrary Topology Shape Reconstruction for Planar Cross Sections. Graphical Models and Image Processing 58(6), 524–543 (1996)
Soroka, B.: Generalized Cones from Serial Sections. Computer Graphics and Image Processing 15(2), 154–166 (1981)
Meyers, D., Skinner, S., Sloan, K.: Surfaces from Contours. ACM Trans. on Graphics 11(3), 228–258 (1992)
Klein, R., Schilling, A., Strasser, W.: Reconstruction and Simplification of Surface from Contours. In: 7th Pacific Conference on Computer Graphics and Applications, pp. 198–207 (1999)
Shin, B., Jung, H.: Fast Reconstruction of 3D Terrain Model from Contour Lines of 2D Maps. In: Baik, D.-K. (ed.) AsiaSim 2004. LNCS (LNAI), vol. 3398, pp. 230–239. Springer, Heidelberg (2005)
Shin, B.: Reconstruction of Human Anatomical Models from Segmented Contour Lines. In: Zhang, J., He, J.-H., Fu, Y. (eds.) CIS 2004. LNCS, vol. 3314, pp. 619–624. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shin, BS., Jung, H.S. (2005). Contour-Based Terrain Model Reconstruction Using Distance Information. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424857_126
Download citation
DOI: https://doi.org/10.1007/11424857_126
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25862-9
Online ISBN: 978-3-540-32045-6
eBook Packages: Computer ScienceComputer Science (R0)