The Floodlight Problem

P. Bose, L. Guibas, A. Lubiw, M. Overmars, D. Souvaine, J. Urrutia
{"title":"The Floodlight Problem","authors":"P. Bose, L. Guibas, A. Lubiw, M. Overmars, D. Souvaine, J. Urrutia","doi":"10.1142/S0218195997000090","DOIUrl":null,"url":null,"abstract":"Given three angles summing to 2π, given n points in the plane and a tripartition k1 + k2 + k3 = n, we can tripartition the plane into three wedges of the given angles so that the i-th wedge contains ki of the points. This new result on dissecting point sets is used to prove that lights of specified angles not exceeding π can be placed at n fixed points in the plane to illuminate the entire plane if and only if the angles sum to at least 2π. We give O(nlog n) algorithms for both these problems.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"53","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Geometry and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0218195997000090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 53

Abstract

Given three angles summing to 2π, given n points in the plane and a tripartition k1 + k2 + k3 = n, we can tripartition the plane into three wedges of the given angles so that the i-th wedge contains ki of the points. This new result on dissecting point sets is used to prove that lights of specified angles not exceeding π can be placed at n fixed points in the plane to illuminate the entire plane if and only if the angles sum to at least 2π. We give O(nlog n) algorithms for both these problems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
泛光灯问题
给定三个角的和为2π,平面上有n个点,用三分法k1 + k2 + k3 = n,我们可以将平面分成给定角的三个楔形,这样第i个楔形包含了这些点的ki。利用这个关于剖分点集的新结果,证明了在平面上的n个不超过π的指定角度的光,当且仅当角度之和至少为2π时,可以放置在平面上的n个不动点上照亮整个平面。对于这两个问题,我们给出了O(nlog n)个算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On Dihedral Angle Sums of Prisms and Hexahedra Some Results on Semi-Symmetric Spaces Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set Navigating Weighted Regions with Scattered Skinny Tetrahedra On the Most Likely Voronoi Diagram and Nearest Neighbor Searching
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1