2021-10-22T05:17:08Zhttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_oaipmh
oai:ipsj.ixsq.nii.ac.jp:002109832021-04-29T15:00:00Z01164:02592:10486:10582
Max-Min 3-dispersion on a Convex PolygonMax-Min 3-dispersion on a Convex Polygonenghttp://id.nii.ac.jp/1001/00210877/Technical Reporthttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_action_common_download&item_id=210983&item_no=1&attribute_id=1&file_no=1Copyright (c) 2021 by the Information Processing Society of JapanKyoto UniversityGunma UniversityYamagata UniversityNational Institute of InformaticsKyushu UniversityIwate UniversityYasuaki, KobayashiShin-ichi, NakanoKei, UchizawaTakeaki, UnoYutaro, YamaguchiKatsuhisa, YamanakaGiven a set P of n points and an integer k, we wish to place k facilities on points in P so that the minimum distance between facilities is maximized. The problem is called the k-dispersion problem, and the set of such k points is called a k-dispersion of P. Note that the 2-dispersion problem corresponds to the computation of the diameter of P. Thus, the k-dispersion problem is a natural generalization of the diameter problem. In this paper, we consider the case of k = 3, which is the 3-dispersion problem, when P is in convex position. We present an O(n2)-time algorithm to compute a 3-dispersion of P.Given a set P of n points and an integer k, we wish to place k facilities on points in P so that the minimum distance between facilities is maximized. The problem is called the k-dispersion problem, and the set of such k points is called a k-dispersion of P. Note that the 2-dispersion problem corresponds to the computation of the diameter of P. Thus, the k-dispersion problem is a natural generalization of the diameter problem. In this paper, we consider the case of k = 3, which is the 3-dispersion problem, when P is in convex position. We present an O(n2)-time algorithm to compute a 3-dispersion of P.AN1009593X研究報告アルゴリズム（AL）2021-AL-1837142021-04-302188-85662021-04-27