Computing the smallest k-enclosing circle and related problems

Alon Efrat, Micha Sharir, Alon Ziv

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

We present an efficient algorithm for solving the “smallest kenclosing circle” (kSC) problem: Given a set of n points in the plane and an integer k ≤ n, find the smallest disk containing k of the points. We present several algorithms that run in O(nk logc n) time, where the constant c depends on the storage that the algorithm is allowed. When using O(nk) storage, the problem can be solved in time O(nklog2 n). When only O(n log n) storage is allowed, the running time is (formula presentd). The method we describe can be easily extended to obtain efficient solutions of several related problems (with similar time and storage bounds). These related problems include: finding the smallest homothetic copy of a given convex polygon P, which contains k points from a given planar set, and finding the smallest hypodrome of a given length and orientation (formally defined in Section 4) containing k points from a given planar set.

Original languageEnglish (US)
Title of host publicationAlgorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings
PublisherSpringer Verlag
Pages325-336
Number of pages12
Volume709 LNCS
ISBN (Print)9783540571551
StatePublished - 1993
Externally publishedYes
Event3rd Workshop on Algorithms and Data Structures, WADS 1993 - Montreal, Canada
Duration: Aug 11 1993Aug 13 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume709 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd Workshop on Algorithms and Data Structures, WADS 1993
CountryCanada
CityMontreal
Period8/11/938/13/93

Fingerprint

Circle
Computing
Convex polygon
Efficient Solution
Efficient Algorithms
Integer

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Efrat, A., Sharir, M., & Ziv, A. (1993). Computing the smallest k-enclosing circle and related problems. In Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings (Vol. 709 LNCS, pp. 325-336). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 709 LNCS). Springer Verlag.

Computing the smallest k-enclosing circle and related problems. / Efrat, Alon; Sharir, Micha; Ziv, Alon.

Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings. Vol. 709 LNCS Springer Verlag, 1993. p. 325-336 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 709 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Efrat, A, Sharir, M & Ziv, A 1993, Computing the smallest k-enclosing circle and related problems. in Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings. vol. 709 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 709 LNCS, Springer Verlag, pp. 325-336, 3rd Workshop on Algorithms and Data Structures, WADS 1993, Montreal, Canada, 8/11/93.
Efrat A, Sharir M, Ziv A. Computing the smallest k-enclosing circle and related problems. In Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings. Vol. 709 LNCS. Springer Verlag. 1993. p. 325-336. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Efrat, Alon ; Sharir, Micha ; Ziv, Alon. / Computing the smallest k-enclosing circle and related problems. Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings. Vol. 709 LNCS Springer Verlag, 1993. pp. 325-336 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2f61402a10944cd3a5a69cba60523451,
title = "Computing the smallest k-enclosing circle and related problems",
abstract = "We present an efficient algorithm for solving the “smallest kenclosing circle” (kSC) problem: Given a set of n points in the plane and an integer k ≤ n, find the smallest disk containing k of the points. We present several algorithms that run in O(nk logc n) time, where the constant c depends on the storage that the algorithm is allowed. When using O(nk) storage, the problem can be solved in time O(nklog2 n). When only O(n log n) storage is allowed, the running time is (formula presentd). The method we describe can be easily extended to obtain efficient solutions of several related problems (with similar time and storage bounds). These related problems include: finding the smallest homothetic copy of a given convex polygon P, which contains k points from a given planar set, and finding the smallest hypodrome of a given length and orientation (formally defined in Section 4) containing k points from a given planar set.",
author = "Alon Efrat and Micha Sharir and Alon Ziv",
year = "1993",
language = "English (US)",
isbn = "9783540571551",
volume = "709 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "325--336",
booktitle = "Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Computing the smallest k-enclosing circle and related problems

AU - Efrat, Alon

AU - Sharir, Micha

AU - Ziv, Alon

PY - 1993

Y1 - 1993

N2 - We present an efficient algorithm for solving the “smallest kenclosing circle” (kSC) problem: Given a set of n points in the plane and an integer k ≤ n, find the smallest disk containing k of the points. We present several algorithms that run in O(nk logc n) time, where the constant c depends on the storage that the algorithm is allowed. When using O(nk) storage, the problem can be solved in time O(nklog2 n). When only O(n log n) storage is allowed, the running time is (formula presentd). The method we describe can be easily extended to obtain efficient solutions of several related problems (with similar time and storage bounds). These related problems include: finding the smallest homothetic copy of a given convex polygon P, which contains k points from a given planar set, and finding the smallest hypodrome of a given length and orientation (formally defined in Section 4) containing k points from a given planar set.

AB - We present an efficient algorithm for solving the “smallest kenclosing circle” (kSC) problem: Given a set of n points in the plane and an integer k ≤ n, find the smallest disk containing k of the points. We present several algorithms that run in O(nk logc n) time, where the constant c depends on the storage that the algorithm is allowed. When using O(nk) storage, the problem can be solved in time O(nklog2 n). When only O(n log n) storage is allowed, the running time is (formula presentd). The method we describe can be easily extended to obtain efficient solutions of several related problems (with similar time and storage bounds). These related problems include: finding the smallest homothetic copy of a given convex polygon P, which contains k points from a given planar set, and finding the smallest hypodrome of a given length and orientation (formally defined in Section 4) containing k points from a given planar set.

UR - http://www.scopus.com/inward/record.url?scp=85029531691&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029531691&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540571551

VL - 709 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 325

EP - 336

BT - Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings

PB - Springer Verlag

ER -