Bounds on the size of tetrahedralizations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Bounds on the size of tetrahedralizations

Full text

Pdf (813 KB)

Source

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

Stony Brook, New York, United States

Pages: 231 - 239

Year of Publication: 1994

ISBN:0-89791-648-4

Authors

Bernard Chazelle	Department of Computer Science, Princeton University, Princeton, NJ
Nadia Shouraboura	Program in Applied and Comput. Math., Princeton University, Princeton, NJ

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): 2, Downloads (12 Months): 11, Citation Count: 5

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/177424.177975 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	Aronov, B., Sharir, M. Triangles in space or building (and analyzing) castles in the air, Combinatorica, 10 (1990), 137-173.
	2	Aronov, B., Sharir, M. The Union of convex polyhedra in three dimensions, Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci. (1993), 518-527.
	3	Boris Aronov , Micha Sharir, Castles in the air revisited, Proceedings of the eighth annual symposium on Computational geometry, p.146-156, June 10-12, 1992, Berlin, Germany [doi>10.1145/142675.142710]
	4	Chanderjit L. Bajaj , Tamal K. Dey, Convex decomposition of polyhedra and robustness, SIAM Journal on Computing, v.21 n.2, p.339-364, April 1992 [doi>10.1137/0221025]
	5	Marshall Bern, Compatible tetrahedralizations, Proceedings of the ninth annual symposium on Computational geometry, p.281-288, May 18-21, 1993, San Diego, California, United States [doi>10.1145/160985.161151]
	6	Bernard Chazelle, Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm, SIAM Journal on Computing, v.13 n.3, p.488-507, August 1984 [doi>10.1137/0213031]
	7	Bernard Chazelle, An optimal algorithm for intersecting three-dimensional convex polyhedra, SIAM Journal on Computing, v.21 n.4, p.671-696, Aug. 1992 [doi>10.1137/0221041]
	8	Bernard Chazelle , Leonidas Palios, Triangulating a nonconvex polytope, Discrete & Computational Geometry, v.5 n.5, p.505-526, 1990 [doi>10.1007/BF02187807]
	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	Dobkin, D.P., Kirkpatrick, D.G. Fast detection of polyhedral intersection, Theoret. Comput. Sci. 27 (1983), 241-253.
	11	Dobkin, D.P., Laszlo, M.J. Primiiives for the manipulation of three-dimensional subdivisions, Algorithmica, 4 (1989), 3-32.
	12	Andrew K. Martin, A Simple Primal Algorithm for Intersecting 3-Polyhedra in Linear Time, University of British Columbia, Vancouver, BC, Canada, 1991
	13	Kurt Mehlhorn, Data structures and algorithms 3: multi-dimensional searching and computational geometry, Springer-Verlag New York, Inc., New York, NY, 1984
	14	Mulmuley, K. Computational Geometry: An Introduction Through Randomized Algoriihms, Prentice-Hall, 1994.
	15	Pellegrini, M. Building convex space partitions induced by pairwise interior-disjoint simplices, ICSI TR-93-039, Aug. 1993.
	16	Jim Ruppert , Raimund Seidel, On the difficulty of triangulating three-dimensional nonconvex polyhedra., Discrete & Computational Geometry, v.7 n.3, p.227-253, 1992 [doi>10.1007/BF02187840]
	17	SchSnhardt, E. Uber die Zerlegung von Dreieckspolyedern in Telraeder, Math. Annalen, 98 (1928), 309-312.

CITED BY 5

	David Eppstein, Linear complexity hexahedral mesh generation, Proceedings of the twelfth annual symposium on Computational geometry, p.58-67, May 24-26, 1996, Philadelphia, Pennsylvania, United States
	Bernard Chazelle , David P. Dobkin , Nadia Shouraboura , Ayellet Tal, Strategies for polyhedral surface decomposition: an experimental study, Proceedings of the eleventh annual symposium on Computational geometry, p.297-305, June 05-07, 1995, Vancouver, British Columbia, Canada
	Bernard Chazelle, Computational geometry: a retrospective, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.75-94, May 23-25, 1994, Montreal, Quebec, Canada
	Boting Yang , Cao An Wang, Detecting tetrahedralizations of a set of line segments, Journal of Algorithms, v.53 n.1, p.1-35, October 2004
	Pankaj K. Agarwal , Boris Aronov , Subhash Suri, Stabbing triangulations by lines in 3D, Proceedings of the eleventh annual symposium on Computational geometry, p.267-276, June 05-07, 1995, Vancouver, British Columbia, Canada