摘要
给定平面内一组互不相交的线段,本文讨论其相对于某点的可见性,给出了时间复杂性为O(mlogm)的算法,并证明了这一算法在时间上是最优的。
For a set of m segments in the plane, this paper discusses their visibility from a point, and presents an algorithm with time complexity O( mlogm ) . This algorithm is proved to be optimal in time.
出处
《计算机应用与软件》
CSCD
2000年第4期18-21,40,共5页
Computer Applications and Software
基金
财政部九五规划课题基金(编号:96075)
关键词
计算几何
线段
可见性
算法
Computational Geometry Segment Visibility Algorithm
