A Voronoi region can be interpreted as the shape achieved by a crystal that grows from a seed and stops growing when it reaches either the domain boundary or another crystal. This analogy is exploited here to devise a method for the generation of anisotropic boundary-conforming Voronoi regions for a set of points. This is achieved by simulating the propagation of crystals as evolving fronts modeled by a level set method. The techniques to detect the collision of fronts (crystals), formation of interfaces between seeds, and treatment of boundaries as additional (inner or outer) restricting seeds are described in detail. The generation of anisotropic Voronoi regions consistent with a user-prescribed Riemannian metric is achieved by re-interpreting the metric tensor in terms of the speed of propagation normal to the boundary of the crystal. This re-interpretation offers a better means of restricting metric fields for mesh generation.

References

References
1.
Okabe
,
A.
,
Boots
,
B.
,
Sugihara
,
K.
, and
Chiu
,
S.
,
2000
,
Spatial Tessellations: Concepts and Applications of Voronoi Diagrams
,
2nd ed.
,
Wiley
,
Chichester, UK
.
2.
Aurenhammer
,
F.
,
1991
, “
Voronoi Diagrams–A Survey of a Fundamental Geometric Data Structure
,”
ACM Comput. Surv.
,
23
(
3
), pp.
345
405
.10.1145/116873.116880
3.
Klein
,
R.
,
1989
,
Concrete and Abstract Voronoi Diagrams
,
Springer
,
Berlin, Germany
.
4.
George
,
P.-L.
, and
Borouchaki
,
H.
,
1998
,
Delaunay Triangulation and Meshing: Application to Finite Elements
,
Hermes
,
Paris, France
.
5.
Du
,
Q.
, and
Wang
,
D.
,
2005
, “
Anisotropic Centroidal Voronoi Tessellations and Their Applications
,”
SIAM J. Sci. Comput.
,
26
(
3
), pp.
737
761
.10.1137/S1064827503428527
6.
Leibon
,
G.
, and
Letscher
,
D.
,
2000
, “
Delaunay Triangulations and Voronoi Diagrams for Riemannian Manifolds
,”
16th Annual Symposium on Computational Geometry
,
SCG’00, ACM
,
New York
, pp.
341
349
.10.1145/336154.336221
7.
Labelle
,
F.
, and
Shewchuk
,
J.
,
2003
, “
Anisotropic Voronoi Diagrams and Guaranteed-Quality Anisotropic Mesh Generation
,”
19th Annual Symposium on Computational Geometry
SCG’03, ACM
,
New York
, pp.
191
200
.10.1145/777792.777822
8.
Yokosuka
,
Y.
, and
Imai
,
K.
,
2009
, “
Guaranteed-Quality Anisotropic Mesh Generation for Domains With Curved Boundaries
,”
Comput.-Aided Des.
,
41
(
5
), pp.
385
393
.10.1016/j.cad.2008.08.010
9.
Boissonnat
,
J.-D.
,
Wormser
,
C.
, and
Yvinec
,
M.
,
2008
, “
Anisotropic Diagrams: Labelle Shewchuk Approach Revisited
,”
Theor. Comput. Sci.
,
408
(
2–3
), pp.
163
173
.10.1016/j.tcs.2008.08.006
10.
Sethian
,
J. A.
,
1999
, “
Level Set Methods and Fast Marching Methods. Evolving Interfaces in Computational Geometry
,”
Fluid Mechanics, Computer Vision, and Materials Science
(Cambridge Monograph on Applied and Computational Mathematics),
2nd ed.
,
Cambridge University Press
,
Cambridge, UK
.
11.
Russo
,
G.
, and
Smereka
,
P.
,
2000
, “
A Level Set Method for the Evolution of Faceted Crystals
,”
SIAM J. Sci. Comput.
,
21
(
6
), pp.
2073
2095
.10.1137/S1064827599351921
12.
Sethian
,
J.
, and
Strain
,
J.
,
1992
, “
Crystal Growth and Dendritic Solidification
,”
J. Comput. Phys.
,
98
(
2
), pp.
231
253
.10.1016/0021-9991(92)90140-T
13.
Shepard
,
D.
,
1968
, “
A Two-Dimensional Interpolation Function for Irregularly-Spaced Data
,”
Proceedings of the 23rd ACM National Conference
,
ACM
,
New York
, pp.
517
524
.
14.
Barth
,
T.
,
1994
, “
Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations
,” (VKI Lecture Notes 1994-05), Von Karman Institute, Sint-Genesius-Rode, Belgium.
15.
Peyre
,
G.
, and
Cohen
,
L.
,
2009
, “
Geodesic Methods for Shape and Surface Processing
,”
Advances in Computational Vision and Medical Image Processing: Methods and Applications
(No. 13 in Computational Methods in Applied Sciences),
J.
Tavares
and
R.
Jorge
, eds.,
Springer
,
Berlin, Germany
, pp.
29
56
.
You do not currently have access to this content.