A point-placement strategy for conforming Delaunay tetrahedralization

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A point-placement strategy for conforming Delaunay tetrahedralization

Full text

Pdf (748 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms table of contents

San Francisco, California, United States

Pages: 67 - 74

Year of Publication: 2000

ISBN:0-89871-453-2

Authors

Michael Murphy	Department of Computer Science, University of Maryland, College Park and Los Alamos National Laboratory
David M. Mount	Department of Computer Science and Inst. for Advanced Computer Studies, University of Maryland, College Park
Carl W. Gable	Geoanalysis Group, Earth and Environmental Science Division, Los Alamos National Laboratory

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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

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.

	BE92	M. Bern and D. Eppstein. Mesh generation and optimal triangulation. In D.-Z. Du and F. K. Hwang, editors, Computing in Euclidean Geometry, volume 1 of Lecture Notes Series on Computing, pages 23-90. World Scientific, Singapore, 1992.
	BP97	M. Bern and P. Plassmann. Mesh generation. Unpublished Manuscript, 1997. Available at http://www.ics.uci.edu/,~eppstein/280g.
	CDE+99	Siu-Wing Cheng , Tamal K. Dey , Herbert Edelsbrunner , Michael A. Facello , Shang-Hua Teng, Sliver exudation, Proceedings of the fifteenth annual symposium on Computational geometry, p.1-13, June 13-16, 1999, Miami Beach, Florida, United States [doi>10.1145/304893.304894]
	Che89a	L. P. Chew. Constrained Delannay triangulations. Algorithmica, 4:97-108, 1989.
	Che89b	L. P. Chew. Guaranteed-quality triangular meshes. Technical Report TR 89-983, Dept. Comput. Sci., Cornell Univ., Ithaca, NY, 1989.
	CM99	P.R. Cavalcanti and U.T. Mello. Three-dimensional constrained Delannay triangulation: A minimalist approach. In Proc. 8th International Meshing Roundtable, Albuquerque, NM, 1999. Sandia National Laboratories.
	ET93	H. Edelsbrunner and T.-S. Tan. An upper bound for conforming Delaunay triangulations. Discrete Comput. Geom., 10(2):197-213, 1993.
	GB98	P.L. George and H. Borouchaki. Delaunay Triangulation and Meshing: Application to Finite-Elements. Hermes, New York, NY, 1998.
	Geo99	P.L. George. Tet meshing: Construction, optimization, and adaptation. In Proc. 8th International Meshing Roundtable, Albuquerque, NM, 1999. Sandia National Laboratories.
	Law77	C. L. Lawson. Software for C1 surface interpolation. In J. R. Rice, editor, Math. Software II1, pages 161-194, New York, NY, 1977. Academic Press.
	MTT+96	G.L. Miller, D. Talmor, S.-H. Teng, N. Walkington, and H. Wang. Control volume meshes using sphere packing: Generation, refinement, and coarsening. In Proc. 5th International Meshing Roundtable, Albuquerque, NM, 1996. Sandia National Laboratories.
	PS85	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	Rup95	Jim Ruppert, A Delaunay refinement algorithm for quality 2-dimensional mesh generation, Journal of Algorithms, v.18 n.3, p.548-585, May 1995
	Saa91	A. Saalfeld. Delaunay edge refinements. In Proc. 3rd Canadian Conf. Comp. Geometry, pages 33-36, 1991.
	SF73	G.J. Strung and G. Fix. An Analysis of the Finite- Element Method. Prentice--Hall, 1973.
	She97	Jonathan Richard Shewchuk , Gary L. Miller , David R. O'Hallaron, Delaunay refinement mesh generation, 1997
	She98a	Jonathan Richard Shewchuk, A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations, Proceedings of the fourteenth annual symposium on Computational geometry, p.76-85, June 07-10, 1998, Minneapolis, Minnesota, United States [doi>10.1145/276884.276893]
	She98b	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]
	Wei87	K. J. Weiler. The radial edge structure: A topological representation for non-manifold geometric modeling. In J. Encarnacao M. Wozny, H. McLaughlin, editor, Geometric Modeling for CAD Applications. Springer Verlag, 1987.

CITED BY 4

	Démian Nave , Nikos Chrisochoides , L. Paul Chew, Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains, Computational Geometry: Theory and Applications, v.28 n.2-3, p.191-215, June 2004
	David Cohen-Steiner , Éric Colin de Verdière , Mariette Yvinec, Conforming Delaunay triangulations in 3D, Proceedings of the eighteenth annual symposium on Computational geometry, p.199-208, June 05-07, 2002, Barcelona, Spain
	Siu-Wing Cheng , Sheung-Hung Poon, Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland
	R. Montenegro , G. Montero , J. M. Escobar , E. Rodríguez, Efficient strategies for adaptive 3-D mesh generation over complex orography, Neural, Parallel & Scientific Computations, v.10 n.1, p.57-76, March 2002