Optimal algorithms for computing the minimum distance between two finite planar sets (1981) [8 citations — 5 self]
Download:
|
|
by Godfried T. Toussaint, Binay K. Bhattacharya
Pattern Recognition Letters
http://www-cgrl.cs.mcgill.ca/~godfried/publications/mindist.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Toussaint81optimalalgorithms,author = {Godfried T. Toussaint and Binay K. Bhattacharya},
title = {Optimal algorithms for computing the minimum distance between two finite planar sets},
booktitle = {Pattern Recognition Letters},
year = {1981},
pages = {79--82}
}
Years of Citing Articles
Abstract:
It is shown in this paper that the minimum distance between two finite planar sets if n points can be computed in O(n log n) worst-case running time and that this is optimal to within a constant factor. Furthermore, when the sets form a convex polygon this complexity can be reduced to O(n). Index terms: minimum distance between sets, cluster analysis, pattern recognition,
