Skip Navigation

The Computer Journal 1981 24(2):162-166; doi:10.1093/comjnl/24.2.162
© 1981 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (309)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bowyer, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Computing Dirichlet tessellations*

A. Bowyer §

School of Mathematics, University of Bath, Claverton Down, Bath, UK

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.

Received April 1980.

* Editorial note: This paper and that by Watson (this issue) cover some material in common. As these contributions were received at approximately the same time, the Editor feels it only right to include both papers.

§ School of Mathematics, University of Bath, Claverton Down, Bath BA2 7AY


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Journal of Reinforced Plastics and CompositesHome page
S. Soukane and F. Trochu
New Remeshing Applications in Resin Transfer Molding
Journal of Reinforced Plastics and Composites, October 1, 2005; 24(15): 1629 - 1653.
[Abstract] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.