Computing Dirichlet tessellations Export

@article{citeulike:2532982, 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. 10.1093/comjnl/24.2.162}, author = {Bowyer, A.}, citeulike-article-id = {2532982}, citeulike-linkout-0 = {http://dx.doi.org/10.1093/comjnl/24.2.162}, citeulike-linkout-1 = {http://comjnl.oxfordjournals.org/cgi/content/abstract/24/2/162}, day = {1}, doi = {10.1093/comjnl/24.2.162}, journal = {The Computer Journal}, keywords = {delaunay, dirichlet, voronoi}, month = {February}, number = {2}, pages = {162--166}, posted-at = {2008-11-03 16:49:53}, priority = {2}, title = {Computing Dirichlet tessellations}, url = {http://dx.doi.org/10.1093/comjnl/24.2.162}, volume = {24}, year = {1981} }

TY - JOUR ID - citeulike:2532982 L3 - citeulike-article-id:2532982 N2 - 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. 10.1093/comjnl/24.2.162 IS - 2 JF - The Computer Journal EP - 166 TI - Computing Dirichlet tessellations VL - 24 SP - 162 KW - delaunay KW - dirichlet KW - voronoi AU - Bowyer, A PY - 1981/02/01/ UR - http://dx.doi.org/10.1093/comjnl/24.2.162 ER -