A linear time algorithm for finding all farthest neighbors in a convex polygon
- 12 April 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 31 (1) , 17-20
- https://doi.org/10.1016/0020-0190(89)90103-8
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- Finding the convex hull of a simple polygonJournal of Algorithms, 1983
- The symmetric all-furthest- neighbor problemComputers & Mathematics with Applications, 1983