Constrained Interpolation with Biarcs

Abstract : An algorithm to construct biarcs that not only match the interpolation requirement of the point positions and tangent vectors but also lie on one side of the constraint line is proposed. For C-type biarc interpolation with the line constraint , firstly twelve inequalities in total are provided according to different position relationships between the constraint line and the interpolation requirement. These inequalities are used to check if biarcs lie on one side of the constraint line. If there exist many biarcs satisfying both the interpolation requirement and the line constraint , the optimal biarc can be obtained by solving a minimum problem. Otherwise , one extra point is added to make it possible to obtain biarcs. For S-type biarc interpolation with the line constraint , some results are also listed.
Type de document :
Article dans une revue
Journal of Computer Aided Design & Computer Graphics, Hujun Bao, 2007
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00519197
Contributeur : Thss Tsinghua <>
Soumis le : samedi 18 septembre 2010 - 20:08:12
Dernière modification le : dimanche 19 septembre 2010 - 20:14:42
Document(s) archivé(s) le : dimanche 19 décembre 2010 - 02:48:52

Fichier

Xu-ZhengLiu2007b.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00519197, version 1

Citation

Xu-Zheng Liu, Jun-Hai Yong, Guo-Qin Zheng, Jia-Guang Sun. Constrained Interpolation with Biarcs. Journal of Computer Aided Design & Computer Graphics, Hujun Bao, 2007. 〈inria-00519197〉

Partager

Métriques

Consultations de la notice

152

Téléchargements de fichiers

163