Abstract
Automatic computation of contour lines on a triangulation is a difficult problem because due to input data digitization and the type of triangulation used, some triangles can be a source of a strange behaviour of the contour lines. In this paper, we show what problems can appear in contour lines when Delaunay or greedy triangulations are used and how the contour lines can be improved using constraints in the triangulation. We improved contour lines by manually imposing constraints in a triangulation editing program. Automation of this process is a next step of our work.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Anglada, M.V.: An Improved Incremental Algorithm for Constructing Restricted Delaunay Triangulations. Computers & Graphics 21, 215–223 (1997)
Aurenhammer, F.: Voronoi Diagrams - a Survey of a Fundamental Geometric Data Structure. ACM Computing Survey 23(3), 345–405 (1991)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry. In: Algorithms and Applications, Springer, Heidelberg (1997)
Dickerson, M.T., Drysdale, R.L.S., McElfresh, S.A., Welzl, E.: Fast Greedy Triangulation Algorithms. In: Proc.10th Annual Symp. on Comp. Geom., pp. 211–220. ACM, New York (1994)
Dyn, N., Levin, D., Rippa, S.: Data Dependent Triangulations for Piecewisse Linear Interpolation. IMA Journal of Numerical Analysis 10, 137–154 (1990)
Kolingerová, I., Žalik, B.: Improvementsto Randomized Incremental Delaunay Insertion. Computers & Graphics 26, 477–490 (2002)
Krcho, J.: Modelling of Georelief and ItsGeometrical Structure Using DTM: Positional and Numerical Accuracy (In Slovak), Georeliéf a geologické procesy, Q111, Bratislava, pp. 269-574 (2001)
Levcopoulos, C., Lingas, A.: Fast Algorithms for Greedy Triangulation. BIT 32, 280–296 (1992)
Okabe, A., Boots, B., Sugihara, K.: Spatial Tesselations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester (1992)
Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)
Sloan, S.W.: A Fast Algorithm for Generating Constrained Delaunay Triangulations. Computers & Structures 47, 441–450 (1993)
Su, P., Drysdale, R.L.S.: A Comparison of Sequential Delaunay Triangulation Algorithms. In: Proc. 11th Annual Symp. on Comp.Geom., pp. 61–70. ACM, New York (1995)
Žalik, B., Kolingerová, I.: An Incremental Construction Algorithm for Delaunay Triangulation Using the Nearest-point Paradigm. Int. J. Geographical Information Science 17, 119–138 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kolingerová, I., Strych, V., Čada, V. (2004). Using Constraints in Delaunay and Greedy Triangulation for Contour Lines Improvement. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science - ICCS 2004. ICCS 2004. Lecture Notes in Computer Science, vol 3039. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25944-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-25944-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22129-6
Online ISBN: 978-3-540-25944-2
eBook Packages: Springer Book Archive