A TIGHT UPPER BOUND FOR THE NUMBER OF INTERSECTIONS BETWEEN 2 RECTANGULAR PATHS

被引：0
|
作者：
TEO, KH
TUAN, TC
机构：
[1] NATL UNIV SINGAPORE,DEPT INFORMAT SYST & COMP SCI,SINGAPORE 0511,SINGAPORE
[2] UNIV OKLAHOMA,SCH ELECT ENGN & COMP SCI,NORMAN,OK 73019
来源：
BIT | 1991年 / 31卷 / 04期
关键词：
COMPUTATIONAL GEOMETRY; INTERFERENCE; INTERSECTION; RECTANGULAR PATH; UPPER BOUND; VLSI LAYOUT;
D O I：
10.1007/BF01933175
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The problem of finding the number of intersections between two geometric figures in the plane has been studied extensively in literature. In this paper, the geometric figure comprising a continuous rectilinear path (called rectangular path) is considered, and a tight (least) upper bound on I(P, Q), the number of intersections between two rectangular paths P and Q, is given.
引用
收藏
页码：598 / 606
页数：9
相关论文
共 50 条
12345