Linear-size nonobtuse triangulation of polygons

Conference · Sun May 01 00:00:00 EDT 1994

OSTI ID:10146198

Bern, M ^[1]; Mitchell, S ^[2]; Ruppert, J ^[3]

---

1. Xerox Palo Alto Research Center, CA (United States)
2. Sandia National Labs., Albuquerque, NM (United States)
3. National Aeronautics and Space Administration, Moffett Field, CA (United States). Ames Research Center

We give an algorithm for triangulating n-vertex polygonal regions (with holes) so that no angle in the final triangulation measures more than {pi}/2. The number of triangles in the triangulation is only 0(n), improving a previous bound of 0(n{sup 2}), and the worst-case running time is 0(n log{sup 2} n). The basic technique used in the algorithm, recursive subdivision by disks, is new and may have wider application in mesh generation. We also report on an implementation of our algorithm.

• Research Organization: Sandia National Labs., Albuquerque, NM (United States)
• Sponsoring Organization: USDOE, Washington, DC (United States)
• DOE Contract Number: AC04-94AL85000
• OSTI ID: 10146198
• Report Number(s): SAND-94-1045C; CONF-9406162-1; ON: DE94010746; BR: GB0103012
• Resource Relation: Conference: 10. annual symposium on computational geometry,Stony Brook, NY (United States),6-8 Jun 1994; Other Information: PBD: [1994]
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
MESH GENERATION
ALGORITHMS
TRIANGULAR CONFIGURATION
POLYNOMIALS
GEOMETRY
FINITE ELEMENT METHOD
990200
MATHEMATICS AND COMPUTERS