On the euclidean distance from a point to a conic
Cargando...
Fecha
Título de la revista
ISSN de la revista
Título del volumen
Editor
Universidad Industrial de Santander
Resumen
Descripción
In this paper a new algorithm to compute thc cuclidean distance froma point to a conie is presented. This algorithm provides good approximation..<;for the euclidcan distancc, even when the point is not very c10seto the given conie. Furthermore, the approximations may be improvediteratively to attain a preseribed ac.curaey. Unlike the most commonlyknown methods to approximate the euclidean distance, in the proposedmethod the coordinates of the footpoint for the orthogonal projection ofthe point on the conie are computed. This particular fcature permits toobtain a noteworthy accuracy without increasing too mueh the oomputationalcostoA pracedure to fit a conic section to a seattered set of points inside atriangle is discussed. The proeedure is based on minimizing the sum ofsquared orthogonal distanee of data points from the canie. The approximateorthogonal distances are computed using the previous algorithm.Keywords. Canies, approximare distance, implicit canic section fitting,least squares. MSC: 65Y25, 51N35.