On good triangulations in three dimensions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On good triangulations in three dimensions

Full text

Pdf (860 KB)

Source

ACM Symposium on Solid and Physical Modeling archive
Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications table of contents

Austin, Texas, United States

Pages: 431 - 441

Year of Publication: 1991

ISBN:0-89791-427-9

Authors

Tamal K. Dey	Department of Computer Science, Purdue University, West Lafayette, IN
Chanderjit L. Bajaj	Department of Computer Science, Purdue University, West Lafayette, IN
Kokicki Sugihara	Department of Computer Science, Purdue University, West Lafayette, IN

Sponsor

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 27, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/112515.112578 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	D Avis , H ElGindy, Triangulating simplicial point sets in space, Proceedings of the second annual symposium on Computational geometry, p.133-141, June 02-04, 1986, Yorktown Heights, New York, United States [doi>10.1145/10515.10530]
	2	Babuska and h.U.Aziz, (1976), "On the Angle Condition in the Finite Element Method", SIAM Numerical Analysis, 13, 214-226.
	3	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]
	4	T.J. Baker, (1989), "Automatic Mesh Generation for Complex Three-Dimensional Regions Using a Constrained Delaunay Triangulation", Engineering with Computers, 5, 161-175.
	5	M. Bern, D. Eppstein, and J. Gilbert, (1990), "Provably Good Mesh Generation", Proc. 31st Annual IEEE Symposium on Foundations of Computer Science, pp. 231-241.
	6	Bernard Chazelle , Leonidas Palios, Triangulating a nonconvex polytope, Discrete & Computational Geometry, v.5 n.5, p.505-526, 1990 [doi>10.1007/BF02187807]
	7	L. P. Chew, (1989), "Guaranteed-Quality Triangular Meshes", Technical Report TR-89-983, Cornell University.
	8	T. Dey, (1990), "Good Triangulations in Plane", Proc. of Second Canadian Conference in Computational Geometry, 102-106.
	9	Tamal K. Dey, Triangulation and CSG representation of polyhedra with arbitrary genus, Proceedings of the seventh annual symposium on Computational geometry, p.364-371, June 10-12, 1991, North Conway, New Hampshire, United States [doi>10.1145/109648.109689]
	10	H. Edelsbrunner,(1989), "Spatial Triangulations with Dihedral Angle Conditions", Proc. of Intl. Workshop on Discrete Algorithms and Complexity, Fukuoka, Japan, 83-89.
	11	H. Edelsbrunner, F.P. Preparata and D.B. West, (1986), "Tetrahedrizing Point Sets in Three Dimensions", Tech. Report UIUCDCS-R-86-1310.
	12	i. Fried, (1972), "Condition of Finite Element Matrices Generated from Nonuniform Meshes", AIAA J., 10, pp. 219-221.
	13	Barry Joe, Three-dimensional triangulations from local transformations, SIAM Journal on Scientific and Statistical Computing, v.10 n.4, p.718-741, July 1989 [doi>10.1137/0910044]
	14	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	15	D.T. Lee, and A.K. Lin,(1986), "Generalized Delaunay triangulation for planar graphs", Discrete and Computational Geometry, 1, 201-217.
	16	K. Sugihara, T. Dey, and C. Bajaj, (1991), "A Robust Method for Finding Geometric Intersection of Three-Dimensional Objects", in preparation.
	17	D. F. Watson, (1981), "Computing the n- Dimensional Tesselation with Applications to Voronoi Polytopes", The Computer Journal, 24, pp. 167-172.

CITED BY 2

	Tamal K. Dey, Triangulation and CSG representation of polyhedra with arbitrary genus, Proceedings of the seventh annual symposium on Computational geometry, p.364-371, June 10-12, 1991, North Conway, New Hampshire, United States
	Gary L. Miller , Dafna Talmor , Shang-Hua Teng , Noel Walkington, A Delaunay based numerical method for three dimensions: generation, formulation, and partition, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.683-692, May 29-June 01, 1995, Las Vegas, Nevada, United States