A simple algorithm for computing the smallest enclosing circle

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  • Department of Computer Science
Presented is a simple O(n log n) algorithm for computing the smallest enclosing circle of a convex polygon. It can be easily extended to algorithms that compute the farthest-and the closest-point Voronoi diagram of a convex polygon within the same time bound.
Original languageEnglish
JournalInformation Processing Letters
Volume37
Issue3
Pages (from-to)121-125
Number of pages5
ISSN0020-0190
DOIs
Publication statusPublished - 1991

See relations at Aarhus University Citationformats

ID: 37371600