Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Thss Tsinghua Connect in order to contact the contributor
Submitted on : Saturday, September 18, 2010 - 8:08:12 PM
Last modification on : Tuesday, June 1, 2021 - 2:34:07 PM
Long-term archiving on: : Sunday, December 19, 2010 - 2:48:52 AM


Files produced by the author(s)


  • HAL Id : inria-00519197, version 1


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⟩



Record views


Files downloads