Abstract:
We study several versions of the problem of generating triangular meshes for finite element methods. We show how to triangulate a planar point set or polygonally bounded domain with triangles of bounded aspect ratio; how to triangulate a planar point set with triangles having no obtuse angles; how to triangulate a point set in arbitrary dimension with simplices of bounded aspect ratio; and how to produce a linear-size Delaunay triangulation of a multi-dimensional point set by adding a linear number of extra points. All our triangulations have size (number of triangles) within a constant factor of optimal, and run in optimal time O(n log n+k) with input of size n and output of size k. No previous work on mesh generation simultaneously guarantees well-shaped elements and small total size. 1. Introduction Geometric partitioning problems ask for the decomposition of a geometric input into simpler objects. These problems are fundamental in many areas, such as solid modeling, computeraided ...
Citations
|
7271
|
Computers and Intractability - A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
1014
|
The Design and Analysis of Spatial Data Structures
– Samet
- 1989
|
|
602
|
Algorithms in Combinatorial Geometry
– Edelsbrunner
- 1987
|
|
303
|
An Analysis of the Finite Element Method
– Strang, Fix
- 1973
|
|
162
|
Mesh generation and optimal triangulation
– Bern, Eppstein
- 1992
|
|
92
|
On the angle condition in the finite element method
– Babuška, Aziz
- 1976
|
|
76
|
triangular meshes
– Chew
- 1989
|
|
74
|
Quality mesh generation in three dimensions
– Mitchell, Vavasis
- 1992
|
|
55
|
Generalized Delaunay triangulation for planar graphs
– Lee, Lin
- 1986
|
|
50
|
Locally equiangular triangulations
– SIBSON
- 1977
|
|
48
|
C.: The Design and Application of Upwind Schemes on Unstructured Meshes
– Barth, Jespersen
- 1989
|
|
41
|
Separators in two and three dimensions
– Miller, Thurston
- 1990
|
|
36
|
On optimal interpolation triangle incidences
– D’Azevedo, Simpson
- 1989
|
|
31
|
Nonobtuse triangulation of polygons
– Baker, Grosse, et al.
- 1988
|
|
31
|
Condition of finite element matrices generated from nonuniform meshes
– Fried
- 1972
|
|
29
|
Triangulating a non-convex polytope
– Chazelle, Palios
- 1990
|
|
27
|
Constrained Delaunay triangulations. Algorithmica, 4(1):97– 108
– Chew
- 1989
|
|
26
|
Polynomial-size nonobtuse triangulation of polygons
– Bern, Eppstein
- 1992
|
|
23
|
A modified quadtree approach to finite element mesh generation
– Yerry, Shephard
- 1983
|
|
21
|
On triangulations of a set of points in the plane
– Lloyd
- 1977
|
|
19
|
Coping with inconsistencies: A new approach to produce quality triangulations of polygonal domains with holes
– Melissaratos, Souvaine
- 1992
|
|
16
|
Globally-equiangular triangulations of co-circular points in O(n log n) time
– Mount, Saalfeld
- 1988
|
|
14
|
A Polynomial Time Algorithm for the Minmax Angle Triangulation
– Edelsbrunner, Tan, et al.
- 1990
|
|
13
|
Approaches to the automatic generation and control of finite element meshes
– Shephard
- 1988
|
|
12
|
Robert Endre Tarjan. Generalized nested dissection
– Lipton, Rose
- 1979
|
|
11
|
A brief review of techniques for generating irregular computational grids
– Thacker
- 1980
|
|
8
|
Approximating the minimum weight triangulation
– Eppstein
- 1992
|
|
3
|
Studies in Discrete and Computational Geometry
– Smith
- 1988
|
|
2
|
Selecting multiply covered points and reducing the size of Delaunay triangulations
– Chazelle, Edelsbrunner, et al.
- 1990
|
|
2
|
Finite Element Triangulation of Complex regions Using Computational Geometry
– Joe
- 1984
|
|
