Cutting cylces of rods in space

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Cutting cylces of rods in space

Full text

Pdf (882 KB)

Source

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

Minneapolis, Minnesota, United States

Pages: 135 - 142

Year of Publication: 1998

ISBN:0-89791-973-4

Author

Alexandra Solan

Department of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel

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

Additional Information:

references cited by index terms 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/276884.276899 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	Bernard Chazelle , Herbert Edelsbrunner , Leonidas J. Guibas , Richard Pollack , Raimund Seidel , Micha Sharir , Jack Snoeyink, Counting and cutting cycles of lines and rods in space, Computational Geometry: Theory and Applications, v.1 n.6, p.305-323, June 1992 [doi>10.1016/0925-7721(92)90009-H]
	2	Mark de Berg , Mark Overmars , Otfried Schwarzkopf, Computing and Verifying Depth Orders, SIAM Journal on Computing, v.23 n.2, p.437-446, April 1994 [doi>10.1137/S0097539791223747]
	3	James D. Foley , Andries Van Dam, Fundamentals of interactive computer graphics, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1982
	4	L. Guibas, M. Overmars and M. Shark, Ray Shooting, Implicit Point Location, and Related Queries in Arrangements of Segments, Tech. Report 433, Computer Science Department, New York University, March 1989.
	5	Leo J. Guibas , F. Frances Yao, On translating a set of rectangles, Proceedings of the twelfth annual ACM symposium on Theory of computing, p.154-160, April 28-30, 1980, Los Angeles, California, United States [doi>10.1145/800141.804663]
	6	Jiří Matoušek, Approximations and optimal geometric divide-and-conquer, Journal of Computer and System Sciences, v.50 n.2, p.203-208, April 1995
	7	T. Ottman and P. Widmayer, On translating a set of line segments, Comp. Vision, Graphics U Image Processing, 24 (1983), 154-160.
	8	Michael S. Paterson , F. Frances Yao, Optimal binary space partitions for orthogonal objects, Journal of Algorithms, v.13 n.1, p.99-113, March 1992 [doi>10.1016/0196-6774(92)90007-Y]
	9	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	10	Hisao Tamaki , Takeshi Tokuyama, How to cut pseudo-parabolas into segments, Proceedings of the eleventh annual symposium on Computational geometry, p.230-237, June 05-07, 1995, Vancouver, British Columbia, Canada [doi>10.1145/220279.220304]

CITED BY 4

	Boris Aronov , Mark de Berg , Chris Gray , Elena Mumford, Cutting cycles of rods in space: hardness and approximation, Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, p.1241-1248, January 20-22, 2008, San Francisco, California
	Boris Aronov , Vladlen Koltun , Micha Sharir, Cutting triangular cycles of lines in space, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
	Sariel Har-Peled , Micha Sharir, Online point location in planar arrangements and its applications, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.57-66, January 07-09, 2001, Washington, D.C., United States
	Pankaj K. Agarwal , Micha Sharir, Pseudo-line arrangements: duality, algorithms, and applications, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.800-809, January 06-08, 2002, San Francisco, California