2012
DOI: 10.1007/s11590-012-0483-7
|View full text |Cite
|
Sign up to set email alerts
|

The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions

Abstract: In this paper we study the following problems: given a finite number of nonempty closed subsets of a normed space, find a ball with the smallest radius that encloses all of the sets, and find a ball with the smallest radius that intersects all of the sets. These problems can be viewed as generalized versions of the smallest enclosing circle problem introduced in the 19th century by Sylvester [12] which asks for the circle of smallest radius enclosing a given set of finite points in the plane. We will focus on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
5
3
2

Relationship

1
9

Authors

Journals

citations
Cited by 18 publications
(11 citation statements)
references
References 12 publications
(10 reference statements)
0
11
0
Order By: Relevance
“…Given a normed vector space V and a proper finite subset S ⊂ V , a minimal enclosing ball for S is a closed ball B ⊂ V which contains S and such that any other ball containing S have a bigger radius. Using classic convex optimization results, one can show the existence and uniqueness of a minimal enclosing ball in the case of rotund reflexive normed vector spaces [14]. One may wonder whether the center c S and the radius r S of the minimal enclosing ball of a proper finite subset S vary continuously with S. This question is naturally posed using the metric exponential Exp M (V ).…”
Section: Interlude: Minimal Enclosing Ballsmentioning
confidence: 99%
“…Given a normed vector space V and a proper finite subset S ⊂ V , a minimal enclosing ball for S is a closed ball B ⊂ V which contains S and such that any other ball containing S have a bigger radius. Using classic convex optimization results, one can show the existence and uniqueness of a minimal enclosing ball in the case of rotund reflexive normed vector spaces [14]. One may wonder whether the center c S and the radius r S of the minimal enclosing ball of a proper finite subset S vary continuously with S. This question is naturally posed using the metric exponential Exp M (V ).…”
Section: Interlude: Minimal Enclosing Ballsmentioning
confidence: 99%
“…This is called the smallest enclosing circle problem, which was introduced by Sylvester [18]. For more information, see [5,13,20]. It is an open problem that d is a g-metric for any n ≥ 3.…”
Section: Theory Of a G-metricmentioning
confidence: 99%
“…We shall refer to this problem as the largest enclosed ball problem (see Figure 4). For previous work on this problem see [18,19] and the references therein. The smallest intersecting and enclosed ball problem.…”
Section: Equivalent Geometric Problemsmentioning
confidence: 99%