{"title":"Explicit G2-constrained Merging of a Pair of Bézier Curves by Control Point Optimization","authors":"Li-Zheng LU , Yu-Yang QIU","doi":"10.1016/S1874-1029(14)60016-1","DOIUrl":null,"url":null,"abstract":"<div><p>This paper presents a simple and explicit method for <em>G</em><sup>2</sup>-constrained merging of a pair of Bézier curves by minimizing the <em>l</em><sub>2</sub> distance defined in terms of control points. After expressing the <em>l</em><sub>2</sub> distance as a quadratic function of two parameters, the optimally merged curve can be explicitly obtained, which is achieved by control point optimization such that the <em>l</em><sub>2</sub> distance is minimized. The existence of the unique solution is shown by proving that the <em>l</em><sub>2</sub> distance is convex. The proposed method is explicit and efficient since it is non-iterative and expressed by known control points. Numerical examples demonstrate the effectiveness of the new method.</p></div>","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"40 7","pages":"Pages 1505-1509"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1874-1029(14)60016-1","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"自动化学报","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1874102914600161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0
Abstract
This paper presents a simple and explicit method for G2-constrained merging of a pair of Bézier curves by minimizing the l2 distance defined in terms of control points. After expressing the l2 distance as a quadratic function of two parameters, the optimally merged curve can be explicitly obtained, which is achieved by control point optimization such that the l2 distance is minimized. The existence of the unique solution is shown by proving that the l2 distance is convex. The proposed method is explicit and efficient since it is non-iterative and expressed by known control points. Numerical examples demonstrate the effectiveness of the new method.
自动化学报Computer Science-Computer Graphics and Computer-Aided Design
CiteScore
4.80
自引率
0.00%
发文量
6655
期刊介绍:
ACTA AUTOMATICA SINICA is a joint publication of Chinese Association of Automation and the Institute of Automation, the Chinese Academy of Sciences. The objective is the high quality and rapid publication of the articles, with a strong focus on new trends, original theoretical and experimental research and developments, emerging technology, and industrial standards in automation.