Polynomial-size nonobtuse triangulation of polygons

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Polynomial-size nonobtuse triangulation of polygons

Full text

Pdf (900 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the seventh annual symposium on Computational geometry table of contents

North Conway, New Hampshire, United States

Pages: 342 - 350

Year of Publication: 1991

ISBN:0-89791-426-0

Authors

Marshall Bern	Xerox Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Alto, CA
David Eppstein	Department of Information and Computer Science, University of California, Irvine, CA

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 21, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/109648.109686 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Brenda S. Baker , Eric Grosse , Conor S. Rafferty, Nonobtuse triangulation of polygons, Discrete & Computational Geometry, v.3 n.2, p.147-168, Jan, 1988 [doi>10.1007/BF02187904]
	2	M. Bern, D. Eppstein, and J. Gilbert. Provably good mesh generation. In 31st Syrup. Found. Comp. $ci., pp. 231-241. IEEE, 1990.
	3	M. Bern and J. Gilbert. Drawing the planar dual. Manuscript, 1991.
	4	L. P. Chew, Constrained Delaunay triangulations, Proceedings of the third annual symposium on Computational geometry, p.215-222, June 08-10, 1987, Waterloo, Ontario, Canada [doi>10.1145/41958.41981]
	5	Herbert Edelsbrunner , Tiow Seng Tan , Roman Waupotitsch, An O(n2log n) time algorithm for the MinMax angle triangulation, Proceedings of the sixth annual symposium on Computational geometry, p.44-52, June 07-09, 1990, Berkley, California, United States [doi>10.1145/98524.98535]
	6	D. Eppstein. The farthest point Delaunay triangulation minimizes angles. Manuscript, 1990.
	7	I. Fried. Condition of finite element matrices generated from nonuniform meshes. AIAA J., 10:219- 221, 1972.
	8	J. L. Gerver. The dissection of a polygon into nearly equilateral triangles. Geom. Dedicata, 16:93-106, 1984.
	9	D. T. Lee and A. K. Lin. Generalized Delaunay triangulation for planar graphs. Discrete and Comp. Geom., 1:201-217, 1986.
	10	D. T. Lee and B. J. Schachter. Two algorithms for constructing a Delaunay triangulation. Int. J. of Computer and Information Sciences, 9:219-242, 1980.
	11	D. M. Mount , A. Saalfeld, Globally-Equiangular triangulations of co-circular points in 0(n log n) time, Proceedings of the fourth annual symposium on Computational geometry, p.143-152, June 06-08, 1988, Urbana-Champaign, Illinois, United States [doi>10.1145/73393.73408]
	12	M. S. Paterson. Personal communication, 1990.
	13	S. Salzberg, A. Delcher, D. Heath, and S. Kasif. Learning with a helpful teacher. To appear in 12th Int. Joint Conf. on Art. Intelligence, Sydney, Australia, 1991.
	14	R. Sibson. Locally equiangular triangulations. Computer J., 21:243-245, 1978.

CITED BY 4

	Herbert Edelsbrunner , Tiow Seng Tan, An upper bound for conforming Delaunay triangulations, Proceedings of the eighth annual symposium on Computational geometry, p.53-62, June 10-12, 1992, Berlin, Germany
	Marshall Bern , David Dobkin , David Eppstein, Triangulating polygons without large angles, Proceedings of the eighth annual symposium on Computational geometry, p.222-231, June 10-12, 1992, Berlin, Germany
	Elefterios A. Melissaratos , Diane L. Souvaine, Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes, Proceedings of the eighth annual symposium on Computational geometry, p.202-211, June 10-12, 1992, Berlin, Germany
	Steven Salzberg , Arthur L. Delcher , David Heath , Simon Kasif, Best-Case Results for Nearest-Neighbor Learning, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.17 n.6, p.599-608, June 1995