关于点集中单调多边形和孔的计数

Q3 Engineering Journal of Computing Science and Engineering Pub Date : 2023-09-30 DOI:10.5626/jcse.2023.17.3.109

Sang-Won Bae

{"title":"关于点集中单调多边形和孔的计数","authors":"Sang-Won Bae","doi":"10.5626/jcse.2023.17.3.109","DOIUrl":null,"url":null,"abstract":"In this paper, we study the problem of counting the number of monotone polygons in a given set S of n points in general position in the plane. A simple polygon is said to be monotone when any vertical line intersects its boundary at most twice. To our best knowledge, this counting problem remains unsolved and no nontrivial algorithm is known so far. As a research step forward to tackle the problem, we define a subclass of monotone polygons and present the first efficient algorithms that exactly count them.","PeriodicalId":37773,"journal":{"name":"Journal of Computing Science and Engineering","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Counting Monotone Polygons and Holes in a Point Set\",\"authors\":\"Sang-Won Bae\",\"doi\":\"10.5626/jcse.2023.17.3.109\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the problem of counting the number of monotone polygons in a given set S of n points in general position in the plane. A simple polygon is said to be monotone when any vertical line intersects its boundary at most twice. To our best knowledge, this counting problem remains unsolved and no nontrivial algorithm is known so far. As a research step forward to tackle the problem, we define a subclass of monotone polygons and present the first efficient algorithms that exactly count them.\",\"PeriodicalId\":37773,\"journal\":{\"name\":\"Journal of Computing Science and Engineering\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computing Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5626/jcse.2023.17.3.109\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computing Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5626/jcse.2023.17.3.109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}

引用次数: 0

摘要

本文研究平面上一般位置上有n个点的给定集合S中单调多边形个数的计算问题。当任何一条垂直线与它的边界相交最多两次时，我们就说它是单调的。据我们所知，这个计数问题仍然没有解决，到目前为止还没有已知的非平凡算法。为了进一步解决这一问题，我们定义了单调多边形的一个子类，并提出了第一个精确计数单调多边形的有效算法。

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

查看原文

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

本刊更多论文

On Counting Monotone Polygons and Holes in a Point Set

In this paper, we study the problem of counting the number of monotone polygons in a given set S of n points in general position in the plane. A simple polygon is said to be monotone when any vertical line intersects its boundary at most twice. To our best knowledge, this counting problem remains unsolved and no nontrivial algorithm is known so far. As a research step forward to tackle the problem, we define a subclass of monotone polygons and present the first efficient algorithms that exactly count them.

求助全文

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

来源期刊

Journal of Computing Science and Engineering Engineering-Engineering (all)

CiteScore

1.00

自引率

0.00%

发文量

期刊介绍： Journal of Computing Science and Engineering (JCSE) is a peer-reviewed quarterly journal that publishes high-quality papers on all aspects of computing science and engineering. The primary objective of JCSE is to be an authoritative international forum for delivering both theoretical and innovative applied researches in the field. JCSE publishes original research contributions, surveys, and experimental studies with scientific advances. The scope of JCSE covers all topics related to computing science and engineering, with a special emphasis on the following areas: Embedded Computing, Ubiquitous Computing, Convergence Computing, Green Computing, Smart and Intelligent Computing, Human Computing.