Sweeping lines and line segments with a heap

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Sweeping lines and line segments with a heap

Full text

Pdf (638 KB)

Source

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

Nice, France

Pages: 469 - 471

Year of Publication: 1997

ISBN:0-89791-878-9

Authors

Julien Basch	Computer Science Department, Stanford University, Stanford, CA
Leonidas J. Guibas	Computer Science Department, Stanford University, Stanford, CA
G. D. Ramkumar	Research & Development Division, Hitachi America Ltd., 3101, Tasman Drive, MS:120, Santa Clara, CA

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): 19, Citation Count: 3

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

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/262839.263089 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.

	BGH97	Julien Basch , Leonidas J. Guibas , John Hershberger, Data structures for mobile data, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.747-756, January 05-07, 1997, New Orleans, Louisiana, United States
	BGR96	Julien Basch , Leonidas J. Guibas , G. D. Ramkumar, Reporting Red-Blue Intersections between Two Sets of Connected Line Segments, Proceedings of the Fourth Annual European Symposium on Algorithms, p.302-319, September 25-27, 1996
	BO79	J.L. Bentley and T. A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE 7Yans. Comput., C-28:643-647, 1979.
	ELSS73	P. Erd6s, L. Lov#sz, A. Simmons, and E. Straus. Dissection graphs of planar point sets. In J. N. Srivastava, editor, A Survey of Combinatorial Theory, pages 139-154. North- Holland, Amsterdam, Netherlands, 1973.
	EW85	H. Edelsbrunner and E. Welzl. On the number of line separations of a finite set in the plane. J. Combin. Theory Set. A, pages 15- 29, 1985.
	Gus79	D. Gusfield. Bounds for the parametric spanning tree problem. In Proc. Humbolt Conf. on Graph Theory, Combinatorics and Computing, pages 173-183, 1979.
	Her89	J. Hershberger, Finding the upper envelope of n line segments in O(n log n) time, Information Processing Letters, v.33 n.4, p.169-174, December 1989 [doi>10.1016/0020-0190(89)90136-1 ]

CITED BY 3

	Guilherme D. da Fonseca , Celina M. H. de Figueiredo, Kinetic heap-ordered trees: tight analysis and improved algorithms, Information Processing Letters, v.85 n.3, p.165-169, 14 February 2003
	Guilherme D. da Fonseca , Celina M. H. de Figueiredo , Paulo C. P. Carvalho, Kinetic hanger, Information Processing Letters, v.89 n.3, p.151-157, 14 February 2004
	Yifan Li , Jiawei Han , Jiong Yang, Clustering moving objects, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA