Algorithms for bichromatic line-segment problems and polyhedral terrains
Authors:
- 1 February 1994
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 11 (2) , 116-132
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Cutting hyperplanes for divide-and-conquerDiscrete & Computational Geometry, 1993
- An optimal algorithm for intersecting line segments in the planeJournal of the ACM, 1992
- An optimal convex hull algorithm and new results on cuttings1991
- An algorithm for generalized point location and its applicationsJournal of Symbolic Computation, 1990
- An Optimal-Time Algorithm for Slope SelectionSIAM Journal on Computing, 1989
- Reporting and Counting Intersections Between Two Sets of Line Segments1988
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Reporting and counting segment intersectionsJournal of Computer and System Sciences, 1986
- Computational Geometry1985