Selecting distances in the plane
- 1 May 1993
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 9 (5) , 495-514
- https://doi.org/10.1007/bf01187037
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Planar geometric location problemsAlgorithmica, 1994
- Arrangements of curves in the plane—topology, combinatorics, and algorithmsTheoretical Computer Science, 1992
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Some techniques for geometric searching with implicit set representationsActa Informatica, 1987
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Time bounds for selectionJournal of Computer and System Sciences, 1973