2008
DOI: 10.1007/s10852-008-9097-6
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Robust Algorithm for Computing Discrete Voronoi Diagrams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 16 publications
(16 citation statements)
references
References 14 publications
0
16
0
Order By: Relevance
“…The numerical implementation is the particle-in-cell finite element code Underworld in which material properties are carried by Lagrangian integration points and mapped to element properties through a local, discrete Voronoi, integration scheme (Veli c et al, 2008). Models are confined to a 3D Cartesian domain (Fig.…”
Section: Model Descriptionmentioning
confidence: 99%
“…The numerical implementation is the particle-in-cell finite element code Underworld in which material properties are carried by Lagrangian integration points and mapped to element properties through a local, discrete Voronoi, integration scheme (Veli c et al, 2008). Models are confined to a 3D Cartesian domain (Fig.…”
Section: Model Descriptionmentioning
confidence: 99%
“…In comparing pAVD with the algorithm of Velić et al [2008], we observe the new algorithm uses ∼6 times less memory when n p < M (“high resolution” Voronoi cell limit), and 3.6 times less when n p ∼ M (“low resolution” Voronoi cell limit). CPU times reveal pAVD is 4.3 times faster in the “high resolution limit” and ∼1.6 times faster in the “low resolution limit”.…”
Section: Examplesmentioning
confidence: 98%
“…To alleviate the practical and technical implementation challenges exact Voronoi diagrams pose, numerous algorithms to compute Approximate Voronoi Diagrams (AVDs) have been developed [ Lavender et al , 1992; Vleugels and Overmars , 1995; Vleugels et al , 1996; Teichmann and Teller , 1997; Hoff et al , 2000; Rong and Tan , 2006; Velić et al , 2008]. Examples of approximate Voronoi diagrams computed using different grid resolutions are shown in Figure 4.…”
Section: Approximate Voronoi Diagrams: From Points To Volumesmentioning
confidence: 99%
See 1 more Smart Citation
“…In an analysis pipeline sequential processing modules obtain and pass on their input as ObjectLayer instances containing all objects and the respective features. Discrete Voronoi tessellation [24] on the object layers map is used to compute the topological relationships. These are represented in an ObjectNetwork class which contains the ObjectNeighbourhood for each object.…”
Section: Introductionmentioning
confidence: 99%