{"title":"最短Bezier曲线的粒子群算法","authors":"Shang Gao, Zaiyue Zhang, C. Cao","doi":"10.1109/IWISA.2009.5073001","DOIUrl":null,"url":null,"abstract":"Bezier curves have become fundamental tools in many challenging and varied applications, ranging from computer- aided geometric design to generic object shape descriptors. Bezier curves have wide applications because they are easy to compute and very stable. Based on analysis of Bezier curve, the problem of the shortest Bezier curve is discussed in this paper. Furthermore, the particle swarm algorithm for this problem is presented. At last, examples are given.","PeriodicalId":6327,"journal":{"name":"2009 International Workshop on Intelligent Systems and Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Particle Swarm Algorithm for the Shortest Bezier Curve\",\"authors\":\"Shang Gao, Zaiyue Zhang, C. Cao\",\"doi\":\"10.1109/IWISA.2009.5073001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Bezier curves have become fundamental tools in many challenging and varied applications, ranging from computer- aided geometric design to generic object shape descriptors. Bezier curves have wide applications because they are easy to compute and very stable. Based on analysis of Bezier curve, the problem of the shortest Bezier curve is discussed in this paper. Furthermore, the particle swarm algorithm for this problem is presented. At last, examples are given.\",\"PeriodicalId\":6327,\"journal\":{\"name\":\"2009 International Workshop on Intelligent Systems and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Workshop on Intelligent Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWISA.2009.5073001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Workshop on Intelligent Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWISA.2009.5073001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Particle Swarm Algorithm for the Shortest Bezier Curve
Bezier curves have become fundamental tools in many challenging and varied applications, ranging from computer- aided geometric design to generic object shape descriptors. Bezier curves have wide applications because they are easy to compute and very stable. Based on analysis of Bezier curve, the problem of the shortest Bezier curve is discussed in this paper. Furthermore, the particle swarm algorithm for this problem is presented. At last, examples are given.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
