用类voronoi结构模拟各向异性发射机覆盖区域

M. Held, Peter Palfrader
{"title":"用类voronoi结构模拟各向异性发射机覆盖区域","authors":"M. Held, Peter Palfrader","doi":"10.14733/CADCONFP.2021.283-287","DOIUrl":null,"url":null,"abstract":"Introduction: Consider a set S of points in the plane, called sites, and a signal that is sent out from each site. Now assume that each signal starts at the same time, say time t := 0, and propagates with unit speed uniformly in all directions. The locations at time t ≥ 0 that are reached by a signal sent out from a site s ∈ S is given by a circle ( o set circle ) of radius t centered at s, and the area that has been covered by that signal by time t is the corresponding circular disc. For t su ciently small, no pair of these discs will intersect. However, as t increases, intersections will occur. Apparently, intersections of two such circles correspond to points of the plane that are reached by two di erent signals at the same time. Assigning each locus of the plane to the site whose signal reached it rst yields a partition of the plane that is well-known as the Voronoi diagram of S; cf. Fig. 1(a). Adjacent regions of this partition are separated by straight-line segments. (We refer to the textbook [11] for more background information on Voronoi diagrams.) The boundary of the area covered by at least one signal by time t is called the wavefront of S at time t. It is easy to see that every wavefront of S consists of circular arcs whose endpoints lie on the Voronoi diagram of S. Voronoi diagrams can be generalized to settings where the signals no longer all travel at the same speed. To each site s a weight σ(s) is assigned that speci es how fast the signal travels: In this modi ed setting, the signal has reached points at distance σ(s) · t (from s) at time t. The corresponding Voronoi diagram is known asmultiplicatively weighted Voronoi diagram [5]. The common boundary of two adjacent regions is no longer a line segment but is a circular arc. Also, the region associated with a speci c site s can now be disconnected or multiply-connected; cf. Fig. 1(b). In a similar way, one can generalize the Voronoi diagram by allowing the sites to start emitting their signals at di erent points in time. This leads to the concept of additively weighted Voronoi diagrams. Voronoi diagrams have become an important geometric tool for modeling and analyzing coverage areas of sensors and transmitters. We refer to [4, 10, 12] for sample publications on this application. Common to these publications is the fact that the signal propagation is assumed to be uniform both over all sites and over all directions for each site.","PeriodicalId":166025,"journal":{"name":"CAD'21 Proceedings","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Modeling Coverage Areas of Anisotropic Transmitters by Voronoi-like Structures\",\"authors\":\"M. Held, Peter Palfrader\",\"doi\":\"10.14733/CADCONFP.2021.283-287\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Introduction: Consider a set S of points in the plane, called sites, and a signal that is sent out from each site. Now assume that each signal starts at the same time, say time t := 0, and propagates with unit speed uniformly in all directions. The locations at time t ≥ 0 that are reached by a signal sent out from a site s ∈ S is given by a circle ( o set circle ) of radius t centered at s, and the area that has been covered by that signal by time t is the corresponding circular disc. For t su ciently small, no pair of these discs will intersect. However, as t increases, intersections will occur. Apparently, intersections of two such circles correspond to points of the plane that are reached by two di erent signals at the same time. Assigning each locus of the plane to the site whose signal reached it rst yields a partition of the plane that is well-known as the Voronoi diagram of S; cf. Fig. 1(a). Adjacent regions of this partition are separated by straight-line segments. (We refer to the textbook [11] for more background information on Voronoi diagrams.) The boundary of the area covered by at least one signal by time t is called the wavefront of S at time t. It is easy to see that every wavefront of S consists of circular arcs whose endpoints lie on the Voronoi diagram of S. Voronoi diagrams can be generalized to settings where the signals no longer all travel at the same speed. To each site s a weight σ(s) is assigned that speci es how fast the signal travels: In this modi ed setting, the signal has reached points at distance σ(s) · t (from s) at time t. The corresponding Voronoi diagram is known asmultiplicatively weighted Voronoi diagram [5]. The common boundary of two adjacent regions is no longer a line segment but is a circular arc. Also, the region associated with a speci c site s can now be disconnected or multiply-connected; cf. Fig. 1(b). In a similar way, one can generalize the Voronoi diagram by allowing the sites to start emitting their signals at di erent points in time. This leads to the concept of additively weighted Voronoi diagrams. Voronoi diagrams have become an important geometric tool for modeling and analyzing coverage areas of sensors and transmitters. We refer to [4, 10, 12] for sample publications on this application. Common to these publications is the fact that the signal propagation is assumed to be uniform both over all sites and over all directions for each site.\",\"PeriodicalId\":166025,\"journal\":{\"name\":\"CAD'21 Proceedings\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CAD'21 Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14733/CADCONFP.2021.283-287\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CAD'21 Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14733/CADCONFP.2021.283-287","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

假设平面上有S个点,称为站点,每个站点发出一个信号。现在假设每个信号在同一时间开始,假设时间t:= 0,并以单位速度向各个方向均匀传播。从站点s∈s发出的信号在t≥0时刻到达的位置用圆心为s的半径为t的圆(0集圆)表示,该信号在t时刻覆盖的面积为对应的圆盘。对于足够小的,没有一对圆盘会相交。。然而,随着t的增加,将会出现交集。显然,两个这样的圆的交点对应于平面上两个不同信号同时到达的点。将平面上的每个轨迹分配给信号最先到达的位置,会得到一个平面的分割,这就是著名的S的Voronoi图;参见图1(a)。该分区的相邻区域由直线段隔开。(有关Voronoi图的更多背景信息,请参阅教科书[11]。)在时间t至少有一个信号覆盖的区域的边界称为S在时间t的波前。很容易看出,S的每个波前都由圆弧组成,圆弧的端点位于S的Voronoi图上。Voronoi图可以推广到信号不再以相同的速度传播的情况。对于每个站点s,分配一个权重σ(s)来指定信号传播的速度:在这个修改后的设置中,信号在时间t到达距离σ(s)·t(从s)的点。相应的Voronoi图被称为乘加权Voronoi图[5]。两个相邻区域的共同边界不再是线段,而是圆弧。此外,与特定站点s相关联的区域现在可以断开连接或多重连接;参见图1(b)。以类似的方式,可以通过允许站点在不同的时间点开始发射信号来推广Voronoi图。这就引出了相加加权Voronoi图的概念。Voronoi图已经成为建模和分析传感器和发射机覆盖区域的重要几何工具。我们参考[4,10,12]来获取关于该应用程序的示例出版物。这些出版物的共同点是假设信号传播在所有站点和每个站点的所有方向上都是均匀的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Modeling Coverage Areas of Anisotropic Transmitters by Voronoi-like Structures
Introduction: Consider a set S of points in the plane, called sites, and a signal that is sent out from each site. Now assume that each signal starts at the same time, say time t := 0, and propagates with unit speed uniformly in all directions. The locations at time t ≥ 0 that are reached by a signal sent out from a site s ∈ S is given by a circle ( o set circle ) of radius t centered at s, and the area that has been covered by that signal by time t is the corresponding circular disc. For t su ciently small, no pair of these discs will intersect. However, as t increases, intersections will occur. Apparently, intersections of two such circles correspond to points of the plane that are reached by two di erent signals at the same time. Assigning each locus of the plane to the site whose signal reached it rst yields a partition of the plane that is well-known as the Voronoi diagram of S; cf. Fig. 1(a). Adjacent regions of this partition are separated by straight-line segments. (We refer to the textbook [11] for more background information on Voronoi diagrams.) The boundary of the area covered by at least one signal by time t is called the wavefront of S at time t. It is easy to see that every wavefront of S consists of circular arcs whose endpoints lie on the Voronoi diagram of S. Voronoi diagrams can be generalized to settings where the signals no longer all travel at the same speed. To each site s a weight σ(s) is assigned that speci es how fast the signal travels: In this modi ed setting, the signal has reached points at distance σ(s) · t (from s) at time t. The corresponding Voronoi diagram is known asmultiplicatively weighted Voronoi diagram [5]. The common boundary of two adjacent regions is no longer a line segment but is a circular arc. Also, the region associated with a speci c site s can now be disconnected or multiply-connected; cf. Fig. 1(b). In a similar way, one can generalize the Voronoi diagram by allowing the sites to start emitting their signals at di erent points in time. This leads to the concept of additively weighted Voronoi diagrams. Voronoi diagrams have become an important geometric tool for modeling and analyzing coverage areas of sensors and transmitters. We refer to [4, 10, 12] for sample publications on this application. Common to these publications is the fact that the signal propagation is assumed to be uniform both over all sites and over all directions for each site.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Interior Ball-Pivoting on Point Clouds for Offsetting Triangular Meshes Modeling Coverage Areas of Anisotropic Transmitters by Voronoi-like Structures Hybrid Line-Arc Toolpath Machining with Corner Transition and Grouping Lookahead Scheme A Semi-Automatic CAD Procedure to Design Custom-made Surgical Cutting Guides Comparative Study of 3D Reconstruction Methods for Medical Imaging
×
引用
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