LINEAR-SIZE NONOBTUSE TRIANGULATION OF POLYGONS

Authors
BERN M MITCHELL S RUPPERT J
Citation
M. Bern et al., LINEAR-SIZE NONOBTUSE TRIANGULATION OF POLYGONS, Discrete & computational geometry, 14(4), 1995, pp. 411-428
Citations number
31
Categorie Soggetti
Computer Sciences, Special Topics","Mathematics, General","Computer Science Theory & Methods",Mathematics
Journal title
Discrete & computational geometry → ACNP
ISSN journal
01795376
Volume
14
Issue
4
Year of publication
1995
Pages
411 - 428
Database
ISI
SICI code
0179-5376(1995)14:4<411:LNTOP>2.0.ZU;2-4
Abstract
We give an algorithm for triangulating n-vertex polygonal regions (wit h holes) so that no angle in the final triangulation measures more tha n pi/2. The number of triangles in the triangulation is only O(n), imp roving a previous bound of O(n(2)), and the running time is O(n log(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.