1981/02/01 by Adrian Bowyer · 3 citations
Computer Science · Engineering · Mathematics · #Computational Geometry and Mesh Generation #3D Modeling in Geospatial Applications #Data Management and Algorithms #Delaunay triangulation #Bowyer–Watson algorithm #Tessellation (computer graphics) #Constrained Delaunay triangulation #Computer science #Triangulation #Pitteway triangulation #Voronoi diagram #Euclidean space #Minimum-weight triangulation #Centroidal Voronoi tessellation #Metric (unit) #Euclidean geometry #Space (punctuation) #Metric space #Algorithm #Mathematics #Computer graphics (images) #Combinatorics #Discrete mathematics #Geometry
paper · pdf · doi:10.1093/comjnl/24.2.162
openalex publication_date 1981/02/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04
An efficient algorithm is proposed for computing the Dirichlet tessellation and Delaunay triangulation in a k dimensional Euclidean space (k≥2). The algorithm is designed in a way that should allow it to be extended to some of the simpler non-Euclidean metric spaces as well. The algorithm has been implemented in ISO FORTRAN by the author and execution time and stereoscopic pictures of the tessellation and triangulation are presented at the end of this paper.