© 1981 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||
Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes*
Department of Geology and Geophysics, Edgeworth-David Building, University of Sydney, Sydney, Australia
The Delaunay tessellation in n-dimensional space is a space-filling aggregate of n-simplices. These n-simplices are the dual forms of the vertices in the commonly used Voronoi tessellation. Several efforts have been made to simulate the 2-dimensional Voronoi tessellation on the computer. Additional problems occur for the 3 and higher dimensional implementations but some of these can be avoided by alternatively computing the dual Delaunay tessellation. An algorithm that finds the topological relationships in these tessellations is given.
Received October 1979. revised July 1980.
* Editorial note: This paper and that by Bowyer (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.
Department of Geology and Geophysics, Edgeworth-David Building, University of Sydney, NSW 2006, Australia
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  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]
|
|
|
|
|
|
E. Bechet, E. Ruiz, F. Trochu, and J.-C. Cuilliere Re-Meshing Algorithms Applied to Mould Filling Simulations in Resin Transfer Moulding Journal of Reinforced Plastics and Composites, January 1, 2004; 23(1): 17 - 36. [Abstract] [PDF]
|
|