Voronoi diagrams and arrangements
Discrete & Computational Geometry
Proceedings of the twelfth annual symposium on Computational geometry
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations
Proceedings of the sixteenth annual symposium on Computational geometry
A new approach for a topographic feature-based characterization of digital elevation data
Proceedings of the 12th annual ACM international workshop on Geographic information systems
An efficient sweep-line Delaunay triangulation algorithm
Computer-Aided Design
Algorithms and theory of computation handbook
A fast algorithm for constructing approximate medial axis of polygons, using Steiner points
Advances in Engineering Software
| Hi-index | 0.00 |
This paper introduces a new algorithm for constrained Delaunay triangulation, which is built upon sets of points and constraining edges. It has various applications in geographical information system (GIS), for example, iso-lines triangulation or the triangulation of polygons in land cadastre. The presented algorithm uses a sweep-line paradigm combined with Lawson's legalisation. An advancing front moves by following the sweep-line. It separates the triangulated and non-triangulated regions of interest. Our algorithm simultaneously triangulates points and constraining edges and thus avoids consuming location of those triangles containing constraining edges, as used by other approaches. The implementation of the algorithm is also considerably simplified by introducing two additional artificial points. Experiments show that the presented algorithm is among the fastest constrained Delaunay triangulation algorithms available at the moment.