### Abstract

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.

Original language | English |
---|---|

Title of host publication | Proceedings of the Sixteenth Canadian Conference on Computational Geometry |

Publication date | 2004 |

Pages | 166-169 |

Publication status | Published - 2004 |

Externally published | Yes |

Event | 16th Canadian Conference on Computational Geometry - Montreal, Canada Duration: 9 Aug 2004 → 11 Aug 2004 Conference number: 16 http://www.cccg.ca/proceedings/2004/ |

### Conference

Conference | 16th Canadian Conference on Computational Geometry |
---|---|

Number | 16 |

Country | Canada |

City | Montreal |

Period | 09/08/2004 → 11/08/2004 |

Internet address |

## Cite this

Anton, F., & Bereg, S. (2004). The Fitting Line Problem in the Laguerre Geometry. In

*Proceedings of the Sixteenth Canadian Conference on Computational Geometry*(pp. 166-169)