The symmetric all-furthest- neighbor problem
- 1 January 1983
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 9 (6) , 747-754
- https://doi.org/10.1016/0898-1221(83)90139-6
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Complexity, convexity, and unimodalityInternational Journal of Parallel Programming, 1984
- On a convex hull algorithm for polygons and its application to triangulation problemsPattern Recognition, 1982
- An Optimal Algorithm for Determining the Visibility of a Polygon from an EdgeIEEE Transactions on Computers, 1981
- A linear algorithm for finding the convex hull of a simple polygonInformation Processing Letters, 1979
- A note on the all nearest-neighbor problem for convex polygonsInformation Processing Letters, 1979
- The all nearest-neighbor problem for convex polygonsInformation Processing Letters, 1978
- Measuring Concavity on a Rectangular MosaicIEEE Transactions on Computers, 1972
- On Sets of Distances of n PointsThe American Mathematical Monthly, 1946