平面上给定的三色点集合中最接近的三色点三组的启发式算法

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI:10.1109/rivf.2012.6169857

Trung Nguyen, D. Duong

{"title":"平面上给定的三色点集合中最接近的三色点三组的启发式算法","authors":"Trung Nguyen, D. Duong","doi":"10.1109/rivf.2012.6169857","DOIUrl":null,"url":null,"abstract":"The problem considering in this paper is as follows: Given n red points, m green points and p blue points on plane, how to find a trio of red-green-blue points such that the distance between them is smallest. This problem could be solved by an exhaustive search algorithm: test all trios of 3 different colored points and find the closest one. However, this algorithm has a big complexity: O(nmp). In this paper, we will present a heuristic algorithm with a better complexity to solve this problem. The heuristic algorithm is based on 2D Voronoi diagram.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Heuristic Algorithm for Finding the Closest Trio of 3-Colored Points from a Given Set of 3-Colored Points on Plane\",\"authors\":\"Trung Nguyen, D. Duong\",\"doi\":\"10.1109/rivf.2012.6169857\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem considering in this paper is as follows: Given n red points, m green points and p blue points on plane, how to find a trio of red-green-blue points such that the distance between them is smallest. This problem could be solved by an exhaustive search algorithm: test all trios of 3 different colored points and find the closest one. However, this algorithm has a big complexity: O(nmp). In this paper, we will present a heuristic algorithm with a better complexity to solve this problem. The heuristic algorithm is based on 2D Voronoi diagram.\",\"PeriodicalId\":115212,\"journal\":{\"name\":\"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/rivf.2012.6169857\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/rivf.2012.6169857","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文考虑的问题是:平面上给定n个红点，m个绿点，p个蓝点，如何找到一个红绿蓝三者之间距离最小的点。这个问题可以通过穷举搜索算法来解决:测试所有3个不同颜色的点，找到最接近的一个。然而，该算法的复杂度很高:0 (nmp)。在本文中，我们将提出一个具有更好复杂度的启发式算法来解决这个问题。启发式算法基于二维Voronoi图。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Heuristic Algorithm for Finding the Closest Trio of 3-Colored Points from a Given Set of 3-Colored Points on Plane

The problem considering in this paper is as follows: Given n red points, m green points and p blue points on plane, how to find a trio of red-green-blue points such that the distance between them is smallest. This problem could be solved by an exhaustive search algorithm: test all trios of 3 different colored points and find the closest one. However, this algorithm has a big complexity: O(nmp). In this paper, we will present a heuristic algorithm with a better complexity to solve this problem. The heuristic algorithm is based on 2D Voronoi diagram.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future

自引率

0.00%

发文量