Computational geometry: an introduction
Computational geometry: an introduction
Introduction to algorithms
Higher-dimensional Voronoi diagrams in linear expected time
Discrete & Computational Geometry
Computational geometry with imprecise data and arithmetic
Computational geometry with imprecise data and arithmetic
A comparison of sequential Delaunay triangulation algorithms
Proceedings of the eleventh annual symposium on Computational geometry
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Voronoi diagrams and Delaunay triangulations
Handbook of discrete and computational geometry
Higher order Delaunay triangulations
Computational Geometry: Theory and Applications
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Three-Dimensional Delaunay Mesh Generation
Discrete & Computational Geometry
Generating realistic terrains with higher-order Delaunay triangulations
Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
Discrete & Computational Geometry
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Constrained higher order Delaunay triangulations
Computational Geometry: Theory and Applications
An efficient sweep-line Delaunay triangulation algorithm
Computer-Aided Design
| Hi-index | 0.00 |
This paper presents a new way to compute the Delaunay triangulation of a planar set P of n points, using sweep-circle technique combined with the standard recursive edge-flipping. The algorithm sweeps the plane by an increasing circle whose center is a fixed point in the convex hull of P. Empirical results and comparisons show that it reduces the number of in-circle tests and edge-flips, and it is efficient in practice.