Linear-size nonobtuse triangulation of polygons
Abstract
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.
- Authors:
-
- Xerox Palo Alto Research Center, CA (United States)
- Sandia National Labs., Albuquerque, NM (United States)
- National Aeronautics and Space Administration, Moffett Field, CA (United States). Ames Research Center
- Publication Date:
- Research Org.:
- Sandia National Labs., Albuquerque, NM (United States)
- Sponsoring Org.:
- USDOE, Washington, DC (United States)
- OSTI Identifier:
- 10146198
- Report Number(s):
- SAND-94-1045C; CONF-9406162-1
ON: DE94010746; BR: GB0103012
- DOE Contract Number:
- AC04-94AL85000
- Resource Type:
- Conference
- 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
- Subject:
- 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; MESH GENERATION; ALGORITHMS; TRIANGULAR CONFIGURATION; POLYNOMIALS; GEOMETRY; FINITE ELEMENT METHOD; 990200; MATHEMATICS AND COMPUTERS
Citation Formats
Bern, M, Mitchell, S, and Ruppert, J. Linear-size nonobtuse triangulation of polygons. United States: N. p., 1994.
Web.
Bern, M, Mitchell, S, & Ruppert, J. Linear-size nonobtuse triangulation of polygons. United States.
Bern, M, Mitchell, S, and Ruppert, J. 1994.
"Linear-size nonobtuse triangulation of polygons". United States. https://www.osti.gov/servlets/purl/10146198.
@article{osti_10146198,
title = {Linear-size nonobtuse triangulation of polygons},
author = {Bern, M and Mitchell, S and Ruppert, J},
abstractNote = {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.},
doi = {},
url = {https://www.osti.gov/biblio/10146198},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Sun May 01 00:00:00 EDT 1994},
month = {Sun May 01 00:00:00 EDT 1994}
}
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.