Not checkedNot checked for notices yet.
Typical curve with G1 constraints for curve completion
Chuan He, Gang Zhao, Aizeng Wang and 3 more
Visual Computing for Industry, Biomedicine, and Art · 2021
doi:10.1186/s42492-021-00095-9 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Abstract 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.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.