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.
Type de document :
Article dans une revue
Journal of Computer Aided Design & Computer Graphics, Hujun Bao, 2008
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00518427
Contributeur : Thss Tsinghua <>
Soumis le : vendredi 17 septembre 2010 - 12:05:05
Dernière modification le : vendredi 17 septembre 2010 - 15:21:16
Document(s) archivé(s) le : samedi 18 décembre 2010 - 03:04:18

Fichier

Xiao-DiaoChen2008a.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00518427, version 1

Citation

Xiao-Diao Chen, Jun-Hai Yong, Guozhao Wang. Computing the minimum distance between two planar algebraic curves. Journal of Computer Aided Design & Computer Graphics, Hujun Bao, 2008. 〈inria-00518427〉

Partager

Métriques

Consultations de la notice

117

Téléchargements de fichiers

129