Diameter, width, closest line pair, and parametric searching
- 1 July 1993
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 10 (2) , 183-196
- https://doi.org/10.1007/bf02573973
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Algorithms for bichromatic line-segment problems and polyhedral terrainsAlgorithmica, 1994
- Computing a Segment Center for a Planar Point SetJournal of Algorithms, 1993
- Selecting distances in the planeAlgorithmica, 1993
- Randomized optimal algorithm for slope selectionInformation Processing Letters, 1991
- A singly exponential stratification scheme for real semi-algebraic varieties and its applicationsTheoretical Computer Science, 1991
- On k-Hulls and Related ProblemsSIAM Journal on Computing, 1987
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975