We address the problem of computing the fitting line of a set of circles in the Laguerre metric, that minimizes the distance to the farthest circle. To solve the fitting line problem we introduce a generalization of the concept of the width of a set of points using the Laguerre metric. We also present an efficient algorithm for finding the fitting line of a set of circles using minimization diagrams with running time O(n^2+epsilon), for any epsilon greater than 0.
|Title of host publication||Proceedings of the Sixteenth Canadian Conference on Computational Geometry|
|Publication status||Published - 2004|
|Event||16th Canadian Conference on Computational Geometry - Montreal, Canada|
Duration: 9 Aug 2004 → 11 Aug 2004
Conference number: 16
|Conference||16th Canadian Conference on Computational Geometry|
|Period||09/08/2004 → 11/08/2004|