Computational geometry: an introduction
Computational geometry: an introduction
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
An O(n2log n) time algorithm for the MinMax angle triangulation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Fast greedy triangulation algorithms
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A comparison of sequential Delaunay triangulation algorithms
Proceedings of the eleventh annual symposium on Computational geometry
Robust adaptive floating-point geometric predicates
Proceedings of the twelfth annual symposium on Computational geometry
Implementations of the LMT heuristic for minimum weight triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
I/O-efficient algorithms for contour-line extraction and planar graph blocking
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract)
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
A time efficient Delaunay refinement algorithm
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Reconstructing domain boundaries within a given set of points, using Delaunay triangulation
Computers & Geosciences
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
An efficient sweep-line Delaunay triangulation algorithm
Computer-Aided Design
| Hi-index | 0.00 |
Contour lines are an important means of cartographical visualization. If computed automatically on a triangulation, they contain many artefacts. This paper shows the results of their elimination by using constrained edges in the triangulation. Constrained edges can be inserted either manually by an editor - which enables all kinds of detected artefacts to be improved manually - or automatically for some kinds of artefacts only. We present a survey of detected artefacts, evaluation of the Delaunay and greedy triangulations as to the number and kind of contour line artefacts, examples of achievements using manual placement of constrained edges and two algorithms suitable for automatic detection and removal of artefacts caused by flat triangle areas. According to our results, problems are not completely removed but the number of problematic areas is decreased substantially.