Coping with inconsistencies

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes

Full text

Pdf (849 KB)

Source

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

Berlin, Germany

Pages: 202 - 211

Year of Publication: 1992

ISBN:0-89791-517-8

Authors

Elefterios A. Melissaratos
Diane L. Souvaine

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): 3, Downloads (12 Months): 18, Citation Count: 9

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/142675.142719 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	R. E. Bank. PLTMG User's Guide. SIAlvl, 1990.
	3	M. Bern, D. Eppstein, and J. Gilbert, "Preyably Good Mesh Generation," FOC$, 1990, 231-241.
	4	Marshall Bern , David Eppstein, Polynomial-size nonobtuse triangulation of polygons, Proceedings of the seventh annual symposium on Computational geometry, p.342-350, June 10-12, 1991, North Conway, New Hampshire, United States [doi>10.1145/109648.109686]
	5	M. Bern and D. Eppstein, "Mesh generation and optimal triangulation," Euclidean Geometry and the Computer, F.K. Hwang, D...Z. Du, eds., World Scientific, 1992, to appeal'.
	6	Bernard Chazelle , Herbert Edelsbrunner , Leonidas J. Guibas , John E. Hershberger , Raimund Seidel , Micha Sharir, Slimming down by adding; selecting heavily covered points, Proceedings of the sixth annual symposium on Computational geometry, p.116-127, June 07-09, 1990, Berkley, California, United States [doi>10.1145/98524.98551]
	7	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]
	8	P.L. Chew, "Guaranteed-quality triangular meshes." Cornell Univ. Tech. Rpt. TR-89- 983, 1989.
	9	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]
	10	W. Frey and D. Field "Mesh Relaxation: A New Technique for improving triangulations,'' General Motors Research Publication GMR-6815.
	11	I. Fried "Condition of finite element ma.trices generated from nonuniform meshes", AIAA J., 1972, 10:219-221.
	12	Barry Joe, Finite element triangulation of complex regions using computational geometry, 1984
	13	S.E. Laux and B.M. Grossman. "A general control volume formulation for modeling impact ionization in semiconductor transport," IEEE Trans. Electron Devices 32~ 1985, 2076- 2081.
	14	D.T. Lee, "Generalized Delaunay trialagulations for planar graphs," Discrete and Comp. Geom., 1, 1986, 201-217.
	15	E.A. Melissaratos and D.L. Souvaine, "Coping with Inconsistencies: A New Approach to Produce Quality Triangulations of Polygonal Domains with Holes." Rutgers Univ. Tech Rpt. LCSR-TR-163, 1991.
	16	Hanan Samet, The Quadtree and Related Hierarchical Data Structures, ACM Computing Surveys (CSUR), v.16 n.2, p.187-260, June 1984 [doi>10.1145/356924.356930]
	17	Hanan Samet, The design and analysis of spatial data structures, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	18	G. Strang and G.J. Fix. "An Analysis of the Finite Element Method," Prentice~Hall, 1973.
	19	M.S. Shephard. "Approaches to the automatic generation and control of finite element meshes." Appl. Mech. Rev., 41, 1988, 169- 185.
	20	W. C. Thacker. "A brief review of techniques for generating irregular computational grids." Int. J. Num. Methods in Eng., 15, 1980, 1335-1341.
	21	M.A. Yerry and M.S. Shephard. "A modified quadtree approach to the finite element mesh generation." IEEE Comp. Graphics and Appl., 3, 1983, 39-46.

CITED BY 9

	Marshall Bern , Paul Chew , David Eppstein , Jim Ruppert, Dihedral bounds for mesh generation in high dimensions, Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, p.189-196, January 22-24, 1995, San Francisco, California, United States
	Scott A. Mitchell , Stephen A. Vavasis, An aspect ratio bound for triangulating a d-grid cut by a hyperplane (extended abstract), Proceedings of the twelfth annual symposium on Computational geometry, p.48-57, May 24-26, 1996, Philadelphia, Pennsylvania, United States
	Tiow-Seng Tan, An optimal bound for conforming quality triangulations: (extended abstract), Proceedings of the tenth annual symposium on Computational geometry, p.240-249, June 06-08, 1994, Stony Brook, New York, United States
	Marshall Bern , Scott Mitchell , Jim Ruppert, Linear-size nonobtuse triangulation of polygons, Proceedings of the tenth annual symposium on Computational geometry, p.221-230, June 06-08, 1994, Stony Brook, New York, United States
	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
	Jim Ruppert, A new and simple algorithm for quality 2-dimensional mesh generation, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.83-92, January 25-27, 1993, Austin, Texas, United States
	L. Paul Chew, Guaranteed-quality mesh generation for curved surfaces, Proceedings of the ninth annual symposium on Computational geometry, p.274-280, May 18-21, 1993, San Diego, California, United States
	Franz Aurenhammer , Naoki Katoh , Hiromichi Kojima , Makoto Ohsaki , Yinfeng Xu, Approximating uniform triangular meshes in polygons, Theoretical Computer Science, v.289 n.2, p.879-895, 30 October 2002
	Yinfeng Xu , Wenqiang Dai , Naoki Katoh , Makoto Ohsaki, Triangulating a convex polygon with fewer number of non-standard bars, Theoretical Computer Science, v.389 n.1-2, p.143-151, December, 2007