The Fitting Line Problem in the Laguerre Geometry

François Anton, Sergey Bereg

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

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 languageEnglish
Title of host publicationProceedings of the Sixteenth Canadian Conference on Computational Geometry
Publication date2004
Pages166-169
Publication statusPublished - 2004
Externally publishedYes
Event16th Canadian Conference on Computational Geometry - Montreal, Canada
Duration: 9 Aug 200411 Aug 2004
Conference number: 16
http://www.cccg.ca/proceedings/2004/

Conference

Conference16th Canadian Conference on Computational Geometry
Number16
CountryCanada
CityMontreal
Period09/08/200411/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)