Guarding points on a terrain by watchtowers

IF 0.4 4区 计算机科学 Q4 MATHEMATICS
Byeonguk Kang , Junhyeok Choi , Jeesun Han , Hee-Kap Ahn
{"title":"Guarding points on a terrain by watchtowers","authors":"Byeonguk Kang ,&nbsp;Junhyeok Choi ,&nbsp;Jeesun Han ,&nbsp;Hee-Kap Ahn","doi":"10.1016/j.comgeo.2025.102210","DOIUrl":null,"url":null,"abstract":"<div><div>We study the problem of guarding points on an <em>x</em>-monotone polygonal chain, called a terrain, using <em>k</em> watchtowers. A watchtower is a vertical segment whose bottom endpoint lies on the terrain. A point on the terrain is visible from a watchtower if the line segment connecting the point and the top endpoint of the watchtower does not cross the terrain. Given a sequence of point sites lying on a terrain, we aim to partition the sequence into <em>k</em> contiguous subsequences and place <em>k</em> watchtowers on the terrain such that every point site in a subsequence is visible from the same watchtower and the maximum length of the watchtowers is minimized. We present efficient algorithms for two variants of the problem.</div></div>","PeriodicalId":51001,"journal":{"name":"Computational Geometry-Theory and Applications","volume":"131 ","pages":"Article 102210"},"PeriodicalIF":0.4000,"publicationDate":"2025-06-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/S0925772125000483","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We study the problem of guarding points on an x-monotone polygonal chain, called a terrain, using k watchtowers. A watchtower is a vertical segment whose bottom endpoint lies on the terrain. A point on the terrain is visible from a watchtower if the line segment connecting the point and the top endpoint of the watchtower does not cross the terrain. Given a sequence of point sites lying on a terrain, we aim to partition the sequence into k contiguous subsequences and place k watchtowers on the terrain such that every point site in a subsequence is visible from the same watchtower and the maximum length of the watchtowers is minimized. We present efficient algorithms for two variants of the problem.
用瞭望塔在地形上守卫点
利用k个瞭望塔研究了x-单调多边形链(称为地形)上点的守卫问题。瞭望塔是一个垂直的部分,其底部端点位于地形上。从瞭望塔上可以看到地形上的一个点,如果连接该点和瞭望塔顶端端点的线段没有穿过地形。给定一个位于地形上的点位置序列,我们的目标是将该序列划分为k个连续子序列,并在地形上放置k个瞭望塔,以便从同一个瞭望塔上可以看到子序列中的每个点位置,并且最小化瞭望塔的最大长度。我们针对这一问题的两个变体提出了有效的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.60
自引率
16.70%
发文量
43
审稿时长
>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.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信