Fast algorithms for computing the diameter of a finite planar set

Binay K. Bhattacharya, Godfried T. Toussaint

Research output: Contribution to journalArticle

Abstract

Three algorithms for computing the diameter of a finite planar set are proposed. Although all three algorithms have (O(n2) worst-case running time, an expected-complexity analysis shows that, under reasonable probabilistic assumptions, all three algorithms have linear expected running time. Experimental results indicate that two of these algorithms perform very well for some distributions, and are competitive with an existing method. Finally, we exhibit situations where these exact algorithms out-perform a published approximate algorithm.

Original languageEnglish (US)
Pages (from-to)379-388
Number of pages10
JournalThe Visual Computer
Volume3
Issue number6
DOIs
StatePublished - Nov 1 1988

    Fingerprint

Keywords

  • Approximate algorithm
  • Diameter
  • Expected complexity
  • Monte Carlo simulation

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design

Cite this