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. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Kolingerová, I., Strych, V., & Čada, V. (2004). Using constraints in Delaunay and greedy triangulation for contour lines improvement. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3039, 123–130. https://doi.org/10.1007/978-3-540-25944-2_16
Mendeley helps you to discover research relevant for your work.