Computing Dirichlet tessellations

Key Points

Key points are not available for this paper at this time.

Abstract

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.

Read Full Paperexternally

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Cite This Study

Adrian Bowyer (Sun,) studied this question.

synapsesocial.com/papers/69e9ca52af6bc739daa819ec https://doi.org/https://doi.org/10.1093/comjnl/24.2.162

Discussion

Journals

The Computer Journal

Institutions

University of Bath

References and Citations

Add This Paper to Your Research Feed

Any time a new paper drops it will be there.