COMPUTING THE CONVEX-HULL IN A HAMMOCK

被引：0
|
作者：
WANG, YL
LEE, RCT
CHANG, JS
机构：
[1] NATL TSING HUA UNIV,COLL ENGN,HSINCHU 30043,TAIWAN
[2] IND TECHNOL RES INST,ELECTR RES & SERV ORG,CTR ADV TECHNOL,HSINCHU,TAIWAN
来源：
INFORMATION SCIENCES | 1992年 / 59卷 / 1-2期
关键词：
D O I：
10.1016/0020-0255(92)90045-A
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper is concerned with the problem of computing the convex hull of line-segment intersections, where all line-segment endpoints are on two vertical lines and there are no vertical line segments. We give an O(n log n) time algorithm to solve this problem, where n is the number of line segments in a hammock. By using a similar scheme, we can also solve the problem of computing the convex hull of line-segment intersections where all line-segment endpoints are on the boundary of the unit circle.
引用
收藏
页码：103 / 119
页数：17
相关论文
共 50 条
12345