用单位圆盘精确覆盖

IF 0.4 4区计算机科学 Q4 MATHEMATICS

Computational Geometry-Theory and Applications Pub Date : 2025-03-26 DOI:10.1016/j.comgeo.2025.102193

Ji Hoon Chun, Christian Kipp, Sandro Roch

{"title":"用单位圆盘精确覆盖","authors":"Ji Hoon Chun, Christian Kipp, Sandro Roch","doi":"10.1016/j.comgeo.2025.102193","DOIUrl":null,"url":null,"abstract":"<div><div>We study the problem of covering a given point set in the plane by unit disks so that each point is covered exactly once. We prove that 17 points can always be exactly covered. On the other hand, we construct a set of 657 points where an exact cover is not possible.</div></div>","PeriodicalId":51001,"journal":{"name":"Computational Geometry-Theory and Applications","volume":"129 ","pages":"Article 102193"},"PeriodicalIF":0.4000,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On exact covering with unit disks\",\"authors\":\"Ji Hoon Chun, Christian Kipp, Sandro Roch\",\"doi\":\"10.1016/j.comgeo.2025.102193\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We study the problem of covering a given point set in the plane by unit disks so that each point is covered exactly once. We prove that 17 points can always be exactly covered. On the other hand, we construct a set of 657 points where an exact cover is not possible.</div></div>\",\"PeriodicalId\":51001,\"journal\":{\"name\":\"Computational Geometry-Theory and Applications\",\"volume\":\"129 \",\"pages\":\"Article 102193\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2025-03-26\",\"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/S0925772125000318\",\"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/S0925772125000318","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

我们研究了用单位圆盘覆盖平面上给定点集的问题，使每个点只覆盖一次。我们证明了17个点总是可以被完全覆盖。另一方面，我们构造一个657个点的集合，其中精确的覆盖是不可能的。

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

查看原文本刊更多论文

On exact covering with unit disks

We study the problem of covering a given point set in the plane by unit disks so that each point is covered exactly once. We prove that 17 points can always be exactly covered. On the other hand, we construct a set of 657 points where an exact cover is not possible.

求助全文

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

来源期刊

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.