最小权值三角剖分的遗传算法

K. Qin, Wenping Wang, Minglun Gong
{"title":"最小权值三角剖分的遗传算法","authors":"K. Qin, Wenping Wang, Minglun Gong","doi":"10.1109/ICEC.1997.592370","DOIUrl":null,"url":null,"abstract":"In this paper, a new method for the minimum weight triangulation of points on a plane, called genetic minimum weight triangulation (GMWT), is presented based on the rationale of genetic algorithms. Polygon crossover and its algorithm for triangulations are proposed. New adaptive genetic operators, or adaptive crossover and mutation operators, are introduced. It is shown that the new method for the minimum weight triangulation can obtain more optimal results of triangulations than the greedy algorithm.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"A genetic algorithm for the minimum weight triangulation\",\"authors\":\"K. Qin, Wenping Wang, Minglun Gong\",\"doi\":\"10.1109/ICEC.1997.592370\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new method for the minimum weight triangulation of points on a plane, called genetic minimum weight triangulation (GMWT), is presented based on the rationale of genetic algorithms. Polygon crossover and its algorithm for triangulations are proposed. New adaptive genetic operators, or adaptive crossover and mutation operators, are introduced. It is shown that the new method for the minimum weight triangulation can obtain more optimal results of triangulations than the greedy algorithm.\",\"PeriodicalId\":167852,\"journal\":{\"name\":\"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEC.1997.592370\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEC.1997.592370","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

基于遗传算法的基本原理,提出了一种平面上点的最小权三角剖分方法——遗传最小权三角剖分。提出了三角剖分中的多边形交叉及其算法。引入了一种新的自适应遗传算子,即自适应交叉和突变算子。结果表明,最小权值三角剖分的新方法比贪心算法能获得更优的三角剖分结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A genetic algorithm for the minimum weight triangulation
In this paper, a new method for the minimum weight triangulation of points on a plane, called genetic minimum weight triangulation (GMWT), is presented based on the rationale of genetic algorithms. Polygon crossover and its algorithm for triangulations are proposed. New adaptive genetic operators, or adaptive crossover and mutation operators, are introduced. It is shown that the new method for the minimum weight triangulation can obtain more optimal results of triangulations than the greedy algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信