1983
DOI: 10.1016/0167-8655(83)90069-7
|View full text |Cite
|
Sign up to set email alerts
|

Computing multidimensional Delaunay tessellations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

1993
1993
2015
2015

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…In 2-D, the method generally accepted as the most efficient is the 'sweepline' algorithm of Fortune (1987). For three or more dimensions, the early methods are ones by Watson (1981), Bowyer (1981) and Devijver & Dekesel (1983). Many of the higher dimensional methods use the 'empty circle' property, which says that the circles (spheres in 3-D) passing through the vertices of Delaunay triangles contain no other nodes.…”
Section: Methods Of Calculating Delaunay Triangulationsmentioning
confidence: 99%
“…In 2-D, the method generally accepted as the most efficient is the 'sweepline' algorithm of Fortune (1987). For three or more dimensions, the early methods are ones by Watson (1981), Bowyer (1981) and Devijver & Dekesel (1983). Many of the higher dimensional methods use the 'empty circle' property, which says that the circles (spheres in 3-D) passing through the vertices of Delaunay triangles contain no other nodes.…”
Section: Methods Of Calculating Delaunay Triangulationsmentioning
confidence: 99%
“…As a result, one can then construct the Voronoi cell by using the techniques, as described, for example, in Balinski (1961), Brostow et al (1978), Devijver and Dekesel (1983), Khang and Fujiwara (1989), Ziegler (1995), and Xu (2006). Now we will give two examples to show how the Voronoi cell associated with the ILS estimator (46) The corresponding two-and three-dimensional Voronoi cells are shown in Fig.…”
Section: Representation Of the Integer Ls Estimatormentioning
confidence: 97%
“…We may note that a rough upper bound of is a rectangular box and has actually already been given by (12). In this section, we will find new bounds that would best approximate from inside and outside in a certain sense of optimality.…”
Section: Examplesmentioning
confidence: 99%
“…Given distinct points in -dimensional space, a number of algorithms have been proposed to find the corresponding Voronoi cells [7], [8], [12], [14], [63]. However, when the number of points tends to infinity so that they form a lattice, finding the Voronoi cell becomes difficult.…”
Section: A Defining Voronoi Cellsmentioning
confidence: 99%