On Some Distance Problems in Fixed Orientations
- 1 August 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 16 (4) , 728-746
- https://doi.org/10.1137/0216049
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Computing the extreme distances between two convex polygonsJournal of Algorithms, 1985
- Computational Geometry—A SurveyIEEE Transactions on Computers, 1984
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Minimum vertex distance between separable convex polygonsInformation Processing Letters, 1984
- Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar PolygonsIEEE Transactions on Computers, 1983
- Efficient algorithms for computing the maximum distance between two finite planar setsJournal of Algorithms, 1983
- Two-Dimensional Voronoi Diagrams in theLp-MetricJournal of the ACM, 1980
- An O ( n log n ) Algorithm for Rectilinear Minimal Spanning TreesJournal of the ACM, 1979
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976