{"title":"最小权值三角剖分的蚁群算法","authors":"Malihe Jahani, B. S. Bigham, Abbas Askari","doi":"10.1109/ICCSA.2010.38","DOIUrl":null,"url":null,"abstract":"A triangulation of a planar set S is a maximal plane straight-line graph with the vertex set S. In the Minimum Weight Triangulation (MWT) problem, we want to draw a triangulation of a given point set that minimizes the sum of the edges length. Recently, Mulzer and Rote have proved that this problem is NP-Hard [10]. In this paper, we present a heuristic algorithm using Ant Colony Optimization to solve this problem.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An Ant Colony Algorithm for the Minimum Weight Triangulation\",\"authors\":\"Malihe Jahani, B. S. Bigham, Abbas Askari\",\"doi\":\"10.1109/ICCSA.2010.38\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A triangulation of a planar set S is a maximal plane straight-line graph with the vertex set S. In the Minimum Weight Triangulation (MWT) problem, we want to draw a triangulation of a given point set that minimizes the sum of the edges length. Recently, Mulzer and Rote have proved that this problem is NP-Hard [10]. In this paper, we present a heuristic algorithm using Ant Colony Optimization to solve this problem.\",\"PeriodicalId\":405597,\"journal\":{\"name\":\"2010 International Conference on Computational Science and Its Applications\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Computational Science and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSA.2010.38\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Computational Science and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSA.2010.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Ant Colony Algorithm for the Minimum Weight Triangulation
A triangulation of a planar set S is a maximal plane straight-line graph with the vertex set S. In the Minimum Weight Triangulation (MWT) problem, we want to draw a triangulation of a given point set that minimizes the sum of the edges length. Recently, Mulzer and Rote have proved that this problem is NP-Hard [10]. In this paper, we present a heuristic algorithm using Ant Colony Optimization to solve this problem.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
