In our paper we approximate a set of given points by a general circle. More precisely, we consider the problem of locating and scaling the unit ball of some given norm k1 with respect to xed points on the plane such that the sum of weighted distances between the circle and the xed points is minimized, where the distance is measured by a norm k2. We present results for the general case. In the case that k1 and k2 are both block norms, we are able to identify a nite dominating set in R3 for the problem, which can be obtained as the intersection of cones.
|Title of host publication||Proceedings of the 21st Canadian Conference on Computational Geometry|
|Publication status||Published - 2009|
|Event||The 21st Canadian Conference on Computational Geometry : CCCG 2009 - Vancouver, BC Canada|
Duration: 1 Jan 2009 → …
|Conference||The 21st Canadian Conference on Computational Geometry : CCCG 2009|
|City||Vancouver, BC Canada|
|Period||01/01/2009 → …|