{"title":"On Voronoi visibility maps of 1.5D terrains with multiple viewpoints","authors":"V. Keikha, Maria Saumell","doi":"10.48550/arXiv.2301.05049","DOIUrl":null,"url":null,"abstract":"Given an $n$-vertex 1.5D terrain $\\T$ and a set $\\A$ of $m<n$ viewpoints, the Voronoi visibility map $\\vorvis(\\T,\\A)$ is a partitioning of $\\T$ into regions such that each region is assigned to the closest (in Euclidean distance) visible viewpoint. The colored visibility map $\\colvis(\\T,\\A)$ is a partitioning of $\\T$ into regions that have the same set of visible viewpoints. In this paper, we propose an algorithm to compute $\\vorvis(\\T,\\A)$ that runs in $O(n+(m^2+k_c)\\log n)$ time, where $k_c$ and $k_v$ denote the total complexity of $\\colvis(\\T,\\A)$ and $\\vorvis(\\T,\\A)$, respectively. This improves upon a previous algorithm for this problem. We also generalize our algorithm to higher order Voronoi visibility maps, and to Voronoi visibility maps with respect to other distances. Finally, we prove bounds relating $k_v$ to $k_c$, and we show an application of our algorithm to a problem on limited range of sight.","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"26 1","pages":"106362"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Inf. Process. Lett.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2301.05049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Given an $n$-vertex 1.5D terrain $\T$ and a set $\A$ of $m
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
