ISSN:
1069-8299
Keywords:
nearest neighbours
;
Voronoi diagram
;
Delaunay triangulation
;
computational geometry
;
algorithms
;
Engineering
;
Numerical Methods and Modeling
Source:
Wiley InterScience Backfile Collection 1832-2000
Topics:
Mathematics
,
Technology
Notes:
This paper deals with the largest interior angle property of the Voronoi nearest neighbours and the Delaunay triangulation in two dimensions. It is indicated that each interior angle opposite to an edge of a Delaunay triangle is the largest of the interior angles opposite the same edge of all possible triangles on the same side. Based on this property, the algorithms for finding the Voronoi neighbours of a point (site) and for constructing the Delaunay triangulation are presented. The algorithms are especially useful for the meshless methods developed in recent years. © 1998 John Wiley & Sons, Ltd.
Additional Material:
2 Ill.
Type of Medium:
Electronic Resource
