Sliver exudation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Sliver exudation

Full text

Pdf (1.38 MB)

Source

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

Miami Beach, Florida, United States

Pages: 1 - 13

Year of Publication: 1999

ISBN:1-58113-068-6

Authors

Siu-Wing Cheng	Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Tamal K. Dey	Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur 721302, India
Herbert Edelsbrunner	Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois and Raindrop Geomagic, Champaign, Illinois
Michael A. Facello	Raindrop Geomagic, Champaign, Illinois
Shang-Hua Teng	Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois

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): 7, Downloads (12 Months): 35, Citation Count: 13

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/304893.304894 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	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
	2	Marshall Bern , David Eppstein , John Gilbert, Provably good mesh generation, Journal of Computer and System Sciences, v.48 n.3, p.384-409, June 1994 [doi>10.1016/S0022-0000(05)80059-5]
	3	L. J. BILLERA, P. FILLIMAN AND S. STURMFELS. Construction and complexity of secondary polytopes. Adv. Math. 83 (1990), 155-179.
	4	J. C. CAVENDISH, D. A. FIELD AND W. n. FREY. An approach to automatic three-dimensional finite element mesh generation. Internat. J. Numer. Methods Engrg. 21 (1985), 329-347.
	5	L. Paul Chew, Guaranteed-quality Delaunay meshing in 3D (short version), Proceedings of the thirteenth annual symposium on Computational geometry, p.391-393, June 04-06, 1997, Nice, France [doi>10.1145/262839.263018]
	6	Philippe G. Ciarlet, Finite Element Method for Elliptic Problems, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2002
	7	B. DELAUNAY. Sur la sphere vide. Izv. Akad. Nauk SSSR, Otdelenie Matematicheskii i Estestvennyka Nauk 7 (1934), 793-800.
	8	T. K. DEY, C. BAJAJ AND K. SUGIHARA. On good triangulations in three dimensions. Internat. J. Comput. Geom. Appl. 2 (1992), 75-95.
	9	H. EDELSBRUNNER AND N. R. SHAH. Incremental topological flipping works for regular triangulations. Algorithmica 15 (1996), 223-241.
	10	n. EDELSBRUNNER AND T. S. TAN. An upper bound for conforming Delaunay triangulations. Discrete Comput. Geom. 10 (1993), 197-213.
	11	Alan M. Frieze , Gary L. Miller , Shang-Hua Teng, Separator based parallel divide and conquer in computational geometry, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.420-429, June 29-July 01, 1992, San Diego, California, United States [doi>10.1145/140901.141934]
	12	I. M. GELFAND, M. M. KAPRANOV AND A. V. ZELE- VINSKY. Discriminants, Resultants and Multidimensional Determinants. Birkh#user, Boston, 1994.
	13	B. JOE. Delaunay versus min-max solid angle triangulations for three-dimensional mesh generation. Internat. J. Numer. Methods Engrg. 31 (1991), 987-997.
	14	A. LIu AND B. JOE. Relationship between tetrahedron shape measures. BIT 34 (1994), 268-287.
	15	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 [doi>10.1145/225058.225286]
	16	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]
	17	V. T. RAJAN. Optimality of the Delaunay triangulation
	18	Jim Ruppert, A Delaunay refinement algorithm for quality 2-dimensional mesh generation, Journal of Algorithms, v.18 n.3, p.548-585, May 1995
	19	Jonathan Richard Shewchuk, Tetrahedral mesh generation by Delaunay refinement, Proceedings of the fourteenth annual symposium on Computational geometry, p.86-95, June 07-10, 1998, Minneapolis, Minnesota, United States [doi>10.1145/276884.276894]
	20	G. STRANG AND G. J. FIX. An Analysis of the Finite Element Method. Prentice Hail, Englewood Cliffs, New Jersey, 1973.
	21	D. TALMOR. Well-spaced points for numerical methods. Report CMU-CS-97-164, Dept. Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, Penn., 1997.
	22	G. VORONOI. Nouvelles applications des param#tres continus k la th@orie des formes quadratiques. J. Reine Angew. Math. 133 (1907), 97-178, and 134 (1908), 198-287.

CITED BY 13

	Hongtao Xu , Timothy S. Newman, An angle-based optimization approach for 2D finite element mesh smoothing, Finite Elements in Analysis and Design, v.42 n.13, p.1150-1164, September 2006
	Xiang-Yang Li , Shang-Hua Teng, Generating well-shaped Delaunay meshed in 3D, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.28-37, January 07-09, 2001, Washington, D.C., United States
	Xiang-Yang Li, Generating well-shaped d-dimensional Delaunay meshes, Theoretical Computer Science, v.296 n.1, p.145-165, 4 March 2003
	Michael Murphy , David M. Mount , Carl W. Gable, A point-placement strategy for conforming Delaunay tetrahedralization, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.67-74, January 09-11, 2000, San Francisco, California, United States
	Marc Vigo , Núria Pla , Josep Cotrina, Regular triangulations of dynamic sets of points, Computer Aided Geometric Design, v.19 n.2, p.127-149, February 2002
	Olivier Devillers , Monique Teillaud, Perturbations and vertex removal in a 3D delaunay triangulation, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland
	Alla Sheffer , Alper Üngör, Efficient adaptive meshing of parametric models, Proceedings of the sixth ACM symposium on Solid modeling and applications, p.59-70, May 2001, Ann Arbor, Michigan, United States
	Pierre Alliez , David Cohen-Steiner , Mariette Yvinec , Mathieu Desbrun, Variational tetrahedral meshing, ACM Transactions on Graphics (TOG), v.24 n.3, July 2005
	Pierre Alliez , David Cohen-Steiner , Mariette Yvinec , Mathieu Desbrun, Variational tetrahedral meshing, ACM SIGGRAPH 2005 Courses, July 31-August 04, 2005, Los Angeles, California
	Danny Z. Chen , Xiaobo Hu , Yingping Huang , Yifan Li , Jinhui Xu, Algorithms for congruent sphere packing and applications, Proceedings of the seventeenth annual symposium on Computational geometry, p.212-221, June 2001, Medford, Massachusetts, United States
	David Eppstein , John M. Sullivan , Alper Üngör, Tiling space and slabs with acute tetrahedra, Computational Geometry: Theory and Applications, v.27 n.3, p.237-255, March 2004
	Jeff Erickson, Nice point sets can have nasty Delaunay triangulations, Proceedings of the seventeenth annual symposium on Computational geometry, p.96-105, June 2001, Medford, Massachusetts, United States
	Jeff Erickson, Dense point sets have sparse Delaunay triangulations: or "…but not too nasty", Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.125-134, January 06-08, 2002, San Francisco, California