Abstract
We approximate a set of given points in the plane by the boundary of a convex and symmetric set which is the unit circle of some norm. This generalizes previous work on the subject which considers Euclidean circles only. More precisely, we examine the problem of locating and scaling the unit circle of some given norm k with respect to given points on the plane such that the sum of weighted distances (as measured by the same norm k) between the circumference of the circle and the points is minimized. We present general results and are able to identify a finite dominating set in the case that k is a polyhedral norm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
