On Counting Monotone Polygons and Holes in a Point Set

Q3 Engineering
Sang-Won Bae
{"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}
引用次数: 0

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.
关于点集中单调多边形和孔的计数
本文研究平面上一般位置上有n个点的给定集合S中单调多边形个数的计算问题。当任何一条垂直线与它的边界相交最多两次时,我们就说它是单调的。据我们所知,这个计数问题仍然没有解决,到目前为止还没有已知的非平凡算法。为了进一步解决这一问题,我们定义了单调多边形的一个子类,并提出了第一个精确计数单调多边形的有效算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Computing Science and Engineering
Journal of Computing Science and Engineering Engineering-Engineering (all)
CiteScore
1.00
自引率
0.00%
发文量
11
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信