An aspect ratio bound for triangulating a d-grid cut by a hyperplane (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An aspect ratio bound for triangulating a d-grid cut by a hyperplane (extended abstract)

Full text

Pdf (890 KB)

Source

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

Philadelphia, Pennsylvania, United States

Pages: 48 - 57

Year of Publication: 1996

ISBN:0-89791-804-5

Authors

Scott A. Mitchell	Computational Mechanics and Visualization Department, Sandia National Laboratories, Albuquerque, NM
Stephen A. Vavasis	Department of Computer Science, Cornell University, Ithaca, NY

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): 12, Citation Count: 1

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/237218.237236 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	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
	3	M. Bern, D. Eppstein, and J. Gilbert. Provably good mesh generation. In Proc. 31st IEEE Syrup. Foundations of Computer Science, pages 231-241, 1990.
	4	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 [doi>10.1145/177424.177974]
	5	L. P. Chew. Guaranteed-quality triangular meshes. Technical Report 89-983, Department of Computer Science, Cornell University, Ithaca, New York, 1989.
	6	E. Durand. Quasitiler 3.0 documentation. See http: // www. geom.umn, edu / apps / quasitiler / about.html, 1994.
	7	P. Frey, B. Sarter, and M. Gautherie. Fully automatic mesh generation for 3-D domains based upon voxel sets. International Journal of Numerical Methods in Engineering, 37:2735-2754, 1994.
	8	C. Johnson. Numerical solution of partial differential equations by the finite element method. Cambridge University Press, 1987.
	9	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 [doi>10.1145/142675.142719]
	10	Scott A. Mitchell , Stephen A. Vavasis, Quality mesh generation in three dimensions, Proceedings of the eighth annual symposium on Computational geometry, p.212-221, June 10-12, 1992, Berlin, Germany [doi>10.1145/142675.142720]
	11	S. A. Mitchell and S. A. Vavasis. Quality mesh generation in higher dimensions. In preparation, 1995.
	12	M. J. Todd. The Computation of Fixed Points and Applications. Springer-Verlag, Berlin, 1976.
	13	S. Vavasis. QMG: a finite element mesh generation package. Available at http: // www.cs.cornell.edu / Info / People / vavasis / qmg-home.html, 1995.
	14	Stephen A. Vavasis, Stable Finite Elements for Problems with Wild Coefficients, Cornell University, Ithaca, NY, 1993