Computing the minimum distance between two planar algebraic curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Computer Aided Design & Computer Graphics Year : 2008

Computing the minimum distance between two planar algebraic curves

Abstract

 Through geomet ric observation , it is found that the nearest point on a curve is a tangent point between the curve and an off set curve of the other curve. Based on this observation , an off set method is presented for computing the minimum distance between two planar algebraic curves. The new method is geomet rically inst ructive , and can be used for computing the minimum distance between an algebraic curve and a parametric one on the same plane. For planar quadratic curves , the degree of the resulting univariate polynomial equation by our method is much lower than that of the equations in previous comparable methods , which may lead to lower computation complexity or higher robustness of the solutions.
Fichier principal
Vignette du fichier
Xiao-DiaoChen2008a.pdf (164.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00518427 , version 1 (17-09-2010)

Identifiers

  • HAL Id : inria-00518427 , version 1

Cite

Xiao-Diao Chen, Jun-Hai Yong, Guozhao Wang. Computing the minimum distance between two planar algebraic curves. Journal of Computer Aided Design & Computer Graphics, 2008. ⟨inria-00518427⟩
82 View
137 Download

Share

Gmail Facebook X LinkedIn More