See this document in CiteSeerX!

Efficient Algorithms for Computing the Maximum Distance  (Make Corrections)  
Between Two Finite Planar Sets Binay K. Bhattacharya and Godfried T....



  Home/Search   Context   Related

 
View or download:
cgm.cs.mcgill.ca/~godfr...maxdist.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cgm.cs.mcgill.ca/~godfried/pub... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: An O(n log n) algorithm is presented for computing the maximum euclidean distance between two finite planar sets of n points. When the n points form the vertices of simple polygons this complexity can be reduced to O(n). The algorithm is empirically compared to the brute-force method as well as an alternate O(n ) algorithm. (Update)

Active bibliography (related documents):   More   All
0.0:   A simple O(n log n) algorithm for finding the maximum.. - Toussaint, McAlear (1982)   (Correct)
0.0:   Efficient Algorithms for Computing the Maximum Distance.. - Bhattacharya, Toussaint (1983)   (Correct)
0.0:   Optimal Algorithms for Computing the Minimum Distance.. - Toussaint, Bhattacharya (1981)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ finite-efficient,
  author = "Between Two Finite",
  title = "Efficient Algorithms for Computing the Maximum Distance",
  url = "citeseer.ist.psu.edu/764215.html" }
Citations (may not include all citations):
2133   Pattern Classification and Scene Analysis (context) - Duda, Hart - 1973
43   Hierarchical clustering schemes (context) - Johnson - 1967
20   Geometric complexity (context) - Shamos - 1975

Documents on the same site (http://cgm.cs.mcgill.ca/~godfried/publications/):   More
On the Sectional Area of Convex Polytopes - Avis, Bose, Shermer, Snoeyink.. (1996)   (Correct)
Convexifying Polygons in 3D: a Survey - Soss, Toussaint   (Correct)
A Faster Algorithm for Computing the Link Distance between .. - Colannino, Toussaint (2005)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC