Typical curve with G1 constraints for curve completion

Visual Computing for Industry, Biomedicine, and Art

Zhanchuan Cai¹  Chuan He²  Aizeng Wang³  Gang Zhao³  Fei Hou⁴  Shaolin Li⁵ 

[1] Faculty of Information Technology, Macau University of Science and Technology, 999078, Macau, China;School of Mechanical Engineering and Automation, Beihang University, 100191, Beijing, China;State Key Laboratory of Lunar and Planetary Sciences, Macau University of Science and Technology, 999078, Macau, China;State Key Laboratory of Virtual Reality Technology and Systems, Beihang University, 100191, Beijing, China;School of Mechanical Engineering and Automation, Beihang University, 100191, Beijing, China;State Key Laboratory of Virtual Reality Technology and Systems, Beihang University, 100191, Beijing, China;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, 100190, Beijing, China;State Key Laboratory of Computer Science, Institute of Software, University of Chinese Academy of Sciences, 100049, Beijing, China;State Key Laboratory of Lunar and Planetary Sciences, Macau University of Science and Technology, 999078, Macau, China;

关键词: Typical curves;    Monotonic curvature;    G1 interpolation;    Curve completion;    Euler spiral;   

DOI  :  10.1186/s42492-021-00095-9

来源: Springer

【 摘 要 】

This paper presents a novel algorithm for planar G1 interpolation using typical curves with monotonic curvature. The G1 interpolation problem is converted into a system of nonlinear equations and sufficient conditions are provided to check whether there is a solution. The proposed algorithm was applied to a curve completion task. The main advantages of the proposed method are its simple construction, compatibility with NURBS, and monotonic curvature.

【 授权许可】

CC BY