用两个全等圆盘覆盖凸多边形

IF 0.4 4区计算机科学 Q4 MATHEMATICS Computational Geometry-Theory and Applications Pub Date : 2023-02-01 DOI:10.1016/j.comgeo.2022.101936

Jongmin Choi , Dahye Jeong , Hee-Kap Ahn

{"title":"用两个全等圆盘覆盖凸多边形","authors":"Jongmin Choi , Dahye Jeong , Hee-Kap Ahn","doi":"10.1016/j.comgeo.2022.101936","DOIUrl":null,"url":null,"abstract":"<div><p><span>We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an </span><span><math><mi>O</mi><mo>(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span>-time algorithm for the two-center problem for a convex polygon, where <em>n</em> is the number of vertices of the polygon. This improves upon the previous best algorithm for the problem.</p></div>","PeriodicalId":51001,"journal":{"name":"Computational Geometry-Theory and Applications","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Covering convex polygons by two congruent disks\",\"authors\":\"Jongmin Choi , Dahye Jeong , Hee-Kap Ahn\",\"doi\":\"10.1016/j.comgeo.2022.101936\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an </span><span><math><mi>O</mi><mo>(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span>-time algorithm for the two-center problem for a convex polygon, where <em>n</em> is the number of vertices of the polygon. This improves upon the previous best algorithm for the problem.</p></div>\",\"PeriodicalId\":51001,\"journal\":{\"name\":\"Computational Geometry-Theory and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Geometry-Theory and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0925772122000797\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Geometry-Theory and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925772122000797","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

我们考虑凸多边形的平面二中心问题：给定平面中的凸多边形，找到两个最小半径的全等圆盘，其并集包含该多边形。我们提出一个O（nlog⁡n）凸多边形双中心问题的时间算法，其中n是多边形的顶点数。这改进了之前针对该问题的最佳算法。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Covering convex polygons by two congruent disks

We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an $O (n \log n)$ -time algorithm for the two-center problem for a convex polygon, where n is the number of vertices of the polygon. This improves upon the previous best algorithm for the problem.

求助全文

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

来源期刊

Computational Geometry-Theory and Applications 数学-数学

CiteScore

1.60

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Computational Geometry is a forum for research in theoretical and applied aspects of computational geometry. The journal publishes fundamental research in all areas of the subject, as well as disseminating information on the applications, techniques, and use of computational geometry. Computational Geometry publishes articles on the design and analysis of geometric algorithms. All aspects of computational geometry are covered, including the numerical, graph theoretical and combinatorial aspects. Also welcomed are computational geometry solutions to fundamental problems arising in computer graphics, pattern recognition, robotics, image processing, CAD-CAM, VLSI design and geographical information systems. Computational Geometry features a special section containing open problems and concise reports on implementations of computational geometry tools.

期刊最新文献

On the orthogonal Grünbaum partition problem in dimension three Computing Euclidean distance and maximum likelihood retraction maps for constrained optimization Editorial Board Largest unit rectangles inscribed in a convex polygon Packing unequal disks in the Euclidean plane