Using the Ellipsoid Method for Sylvester's Problem and its Generalization
Sylvester's problem or the problem of the smallest bounding circle is the problem of constructing a circle of the smallest radius that contains a finite set of points on the plane. In n-dimensional space, it corresponds to the problem of the smallest bounding hypersphere, which can be formulate...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
V.M. Glushkov Institute of Cybernetics
2024-03-01
|
Series: | Кібернетика та комп'ютерні технології |
Subjects: | |
Online Access: | http://cctech.org.ua/13-vertikalnoe-menyu-en/557-abstract-24-1-3-arte |