Intersection and Closest-Pair Problems for a Set of Planar Discs
- 1 May 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (2), 448-468
- https://doi.org/10.1137/0214034
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Efficient Detection of Intersections among SpheresThe International Journal of Robotics Research, 1983
- On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriersCommunications on Pure and Applied Mathematics, 1983
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- A New Approach to Planar Point LocationSIAM Journal on Computing, 1981
- Generalization of Voronoi Diagrams in the PlaneSIAM Journal on Computing, 1981
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979