Computing Dirichlet Tessellations
Bowyer A.
The Computer Journal, Heyden & Sons Ltd, Vol 2, Num 24, pp.162-166, 1981
An efficient algorithm is proposed for computing the Dirichlet tesselation 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 times and stereoscopic pictures of the tesselation and triangulation are presented at the end of this paper.
Contact author(s) or publisher for availability and copyright information on above referenced article