Planar lower envelope of monotone polygonal chains

被引：0
|
作者：
Lu, Daniel L. [1 ]
机构：
[1] Carnegie Mellon Univ, Inst Robot, Pittsburgh, PA 15213 USA
来源：
INFORMATION PROCESSING LETTERS | 2015年 / 115卷 / 12期
关键词：
Computational geometry; Upper envelope; Lower envelope; Output-sensitive algorithms; VISIBILITY QUERIES; LINE SEGMENTS; ALGORITHM; POINT;
D O I：
10.1016/j.ipl.2015.07.004
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A simple linear search algorithm running in O(n + ink) time is proposed for constructing the lower envelope of k vertices from m monotone polygonal chains in 2D with n vertices in total. This can be applied to output-sensitive construction of lower envelopes for n arbitrary line segments in optimal O(n logk) time, where k is the output size. Compared to existing output-sensitive algorithms for lower envelopes, this is simpler to implement, does not require complex data structures, and is a constant factor faster. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码：962 / 964
页数：3
相关论文
共 50 条
12345