Sweeping lines and line segments with a heap

Authors:
Julien Basch;Leonidas J. Guibas;G. D. Ramkumar
Affiliations:
Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA;Research & Development Division, Hitachi America Ltd., 3101, Tasman Drive, MS:120, Santa Clara, CA
Venue:
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Year:
1997

Citing 3
Cited 4

Finding the upper envelope of n line segments in O(n log n) time

Information Processing Letters
Data structures for mobile data

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Reporting Red-Blue Intersections between Two Sets of Connected Line Segments

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms

Kinetic heap-ordered trees: tight analysis and improved algorithms

Information Processing Letters
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Kinetic hanger

Information Processing Letters
Clustering moving objects

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract