A simple algorithm for computing the smallest enclosing circle

Sven Skyum

doi:10.1016/0020-0190(91)90030-L

A simple algorithm for computing the smallest enclosing circle

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

Abstract

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 language	English
Journal	Information Processing Letters
Volume	37
Issue	3
Pages (from-to)	121-125
Number of pages	5
ISSN	0020-0190
DOIs	https://doi.org/10.1016/0020-0190(91)90030-L
Publication status	Published - 1991

Access to Document

10.1016/0020-0190(91)90030-L

Cite this

@article{f91e0b0d9afc42edbaed325132c728ff,

title = "A simple algorithm for computing the smallest enclosing circle",

abstract = "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.",

author = "Sven Skyum",

year = "1991",

doi = "10.1016/0020-0190(91)90030-L",

language = "English",

volume = "37",

pages = "121--125",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier BV",

number = "3",

}

TY - JOUR

T1 - A simple algorithm for computing the smallest enclosing circle

AU - Skyum, Sven

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

U2 - 10.1016/0020-0190(91)90030-L

DO - 10.1016/0020-0190(91)90030-L

M3 - Journal article

SN - 0020-0190

VL - 37

SP - 121

EP - 125

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

A simple algorithm for computing the smallest enclosing circle

Abstract

Access to Document

Fingerprint

Cite this