1 / 44

Anisotropic Voronoi Diagrams and Guaranteed-Quality Anisotropic Mesh Generation

Anisotropic Voronoi Diagrams and Guaranteed-Quality Anisotropic Mesh Generation. Jonathan Richard Shewchuk. François Labelle. Computer Science Division University of California at Berkeley Berkeley, California Presented by Jessica Schoen. Outline. Anisotropic meshes

donna-tran
Download Presentation

Anisotropic Voronoi Diagrams and Guaranteed-Quality Anisotropic Mesh Generation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Anisotropic Voronoi Diagrams and Guaranteed-Quality Anisotropic Mesh Generation Jonathan Richard Shewchuk François Labelle Computer Science Division University of California at Berkeley Berkeley, California Presented by Jessica Schoen

  2. Outline Anisotropic meshes Anisotropic Voronoi diagrams Algorithm for anisotropic mesh generation Current research

  3. I. Anisotropic Meshes

  4. What 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.

  5. Distance Measures Metric tensor Mp: distances & angles measured by p. Deformation tensor Fp: maps physical to rectified space. Mp =FpTFp. Physical Space q Fp Fq p FqFp-1 p q FpFq-1

  6. Distance Measures Metric tensor Mp: distances & angles measured by p. Deformation tensor Fp: maps physical to rectified space. Mp =FpTFp. Physical Space q Fp Fq p FqFp-1 p q FpFq-1 Every point wants to be in a “nice” triangle in rectified space.

  7. The Anisotropic Mesh Generation Problem Given polygonal domain and metric tensor field M, generate anisotropic mesh.

  8. A 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.

  9. Heuristic Algorithms forGenerating Anisotropic Meshes George-Borouchaki [1998] Bossen-Heckbert [1996] Shimada-Yamada-Itoh [1997] Li-Teng-Üngör [1999]

  10. II. Anisotropic Voronoi Diagrams

  11. Voronoi Diagram: Definition Given a set Vof sites in Ed, decompose Edinto 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

  12. Distance Function Examples • Standard Voronoi diagram dv(p) = || p – v ||2

  13. Distance Function Examples 2. Multiplicatively weighted Voronoi diagram dv(p) = cv|| p – v ||2

  14. Distance Function Examples 3. Anisotropic Voronoi diagram dv(p) = [(p – v)TMv(p – v)]1/2

  15. Anisotropic Voronoi Diagram

  16. Duality

  17. Two Sites Define a Wedge

  18. Dual Triangulation Theorem

  19. III. Anisotropic Mesh Generation by Voronoi Refinement

  20. Easy Case: M = constant

  21. Easy Case: M = constant

  22. Voronoi Refinement Algorithm

  23. Voronoi Refinement Algorithm Islands Insert new sites on unwedged portions of arcs.

  24. Voronoi Refinement Algorithm Orphan Insert new sites on unwedged portions of arcs.

  25. Voronoi Refinement Algorithm

  26. Encroachment

  27. Special Rules for the Boundary

  28. Special Rules for the Boundary

  29. Main Result

  30. Why Does It Work?

  31. Why Does It Work?

  32. Numerical Problem Red Voronoi vertex is intersection of conic sections

  33. Numerical Problem Intersection is computed numerically ?

  34. Numerical Problem Which side of the red line is the vertex on? ?

  35. Numerical Problem Which side of the red line is the vertex on? Geometric predicates are not always truthful and the program crashes. ?

  36. IV. My Current Research

  37. Star of a Vertex: Definition The star of a vertexv is the set of all simplices having v for a face.

  38. Star Based Anisotropic Meshing Each vertex computes its own star independently

  39. Inconsistent 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.

  40. Equivalence 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

More Related