Title: Anisotropic Voronoi Diagrams and GuaranteedQuality Anisotropic Mesh Generation
1Anisotropic Voronoi Diagrams and
Guaranteed-Quality Anisotropic Mesh Generation
Jonathan Richard Shewchuk
Computer Science Division University of
California at Berkeley Berkeley,
California Presented by Jessica Schoen
2Outline
- Anisotropic meshes
- Anisotropic Voronoi diagrams
- Algorithm for anisotropic mesh generation
- Current research
3I. Anisotropic Meshes
4What Are Anisotropic Meshes?
- Meshes with long, skinny triangles (in the right
places).
Why are they important?
- Often provide better interpolation of
multivariate functions with fewer triangles. - Used in finite element methods to resolve
boundary layers and shocks.
Source Grid Generation by the Delaunay
Triangulation, Nigel P. Weatherill, 1994.
5Distance Measures
- Metric tensor Mp distances angles measured by
p. - Deformation tensor Fp maps physical to rectified
space. - Mp FpT Fp.
Physical Space
q
Fp
Fq
p
FqFp-1
p
q
FpFq-1
6Distance Measures
- Metric tensor Mp distances angles measured by
p. - Deformation tensor Fp maps physical to rectified
space. - Mp FpT Fp.
Physical Space
q
Fp
Fq
p
FqFp-1
p
q
FpFq-1
Every point wants to be in a nice triangle in
rectified space.
7The Anisotropic Mesh Generation Problem
- Given polygonal domain and metric tensor field M,
generate anisotropic mesh.
8A Hard Problem (Especially in Theory)
Common approaches to guaranteed-quality mesh
generation do not adapt well to anisotropy.
- Quadtree-based methods can be adapted to
horizontal and vertical stretching, but not to
diagonal stretching.
- Delaunay triangulations lose their global
optimality properties when adapted to anisotropy.
No empty circumellipse property.
9Heuristic Algorithms forGenerating Anisotropic
Meshes
Bossen-Heckbert 1996
George-Borouchaki 1998
Shimada-Yamada-Itoh 1997
Li-Teng-Üngör 1999
10II. Anisotropic Voronoi Diagrams
11Voronoi Diagram Definition
- Given a set V of sites in Ed, decompose Ed into
cells. The cell Vor(v) is the set of points
closer to v than to any other site in V. - Mathematically
- Vor(v) p in Ed dv(p) dw(p) for every w in V.
distance from v to p as measured by v
12Distance Function Examples
- Standard Voronoi diagram
- dv(p) p v 2
13Distance Function Examples
- 2. Multiplicatively weighted Voronoi diagram
- dv(p) cv p v 2
14Distance Function Examples
- 3. Anisotropic Voronoi diagram
- dv(p) (p v)TMv(p v)1/2
15Anisotropic Voronoi Diagram
16Duality
17Two Sites Define a Wedge
18(No Transcript)
19Dual Triangulation Theorem
20III. Anisotropic Mesh Generation by Voronoi
Refinement
21Easy Case M constant
22Easy Case M constant
23(No Transcript)
24Voronoi Refinement Algorithm
25Voronoi Refinement Algorithm
Islands
Insert new sites on unwedged portions of arcs.
26Voronoi Refinement Algorithm
Orphan
Insert new sites on unwedged portions of arcs.
27(No Transcript)
28Voronoi Refinement Algorithm
29Encroachment
30Special Rules for the Boundary
31Special Rules for the Boundary
32Main Result
33Why Does It Work?
34Why Does It Work?
35Numerical Problem
Red Voronoi vertex is intersection of conic
sections
36Numerical Problem
Intersection is computed numerically
?
37Numerical Problem
Which side of the red line is the vertex on?
?
38Numerical Problem
Which side of the red line is the vertex on?
Geometric predicates are not always truthful
and the program crashes.
?
39IV. My Current Research
40Star of a Vertex Definition
- The star of a vertex v is the set of all
simplices having v for a face.
41Star Based Anisotropic Meshing
- Each vertex computes its own star independently
42Inconsistent Stars
- If the arcs and vertices of the corresponding
anisotropic Voronoi diagram are not all wedged,
the diagram may not dualize to a triangulation,
and the independently constructed stars may not
form a consistent triangulation.
43Equivalence Theorem
- If the arcs and vertices of the anisotropic
Voronoi diagram are all wedged, then
v
v
contains the same sites as star(v) in the dual of
the anisotropic Voronoi diagram.
the independently constructed star of v
44(No Transcript)