LOWER BOUNDS FOR LINE STABBING

被引:16
作者
AVIS, D [1 ]
ROBERT, JM [1 ]
WENGER, R [1 ]
机构
[1] UNIV MONTREAL,DEPT INFORMAT,MONTREAL H3C 3J7,QUEBEC,CANADA
关键词
D O I
10.1016/0020-0190(89)90155-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:59 / 62
页数:4
相关论文
共 31 条
[1]  
[Anonymous], 1987, EATCS MONOGRAPHS THE
[2]   EFFICIENT ALGORITHMS FOR COMMON TRANSVERSALS [J].
ATALLAH, M ;
BAJAJ, C .
INFORMATION PROCESSING LETTERS, 1987, 25 (02) :87-91
[3]  
AVIS D, IN PRESS DISCR MATH
[4]  
AVIS D, 1987, 3RD P ACM S COMP GEO, P300
[5]   LINEAR TIME ALGORITHMS FOR 2-VARIABLE AND 3-VARIABLE LINEAR-PROGRAMS [J].
DYER, ME .
SIAM JOURNAL ON COMPUTING, 1984, 13 (01) :31-45
[6]   FINDING TRANSVERSALS FOR SETS OF SIMPLE GEOMETRIC-FIGURES [J].
EDELSBRUNNER, H .
THEORETICAL COMPUTER SCIENCE, 1985, 35 (01) :55-69
[7]  
EDELSBRUNNER H, 1982, BIT, V22, P274, DOI 10.1007/BF01934440
[8]  
EDELSBRUNNER H, 1987, UIUCDCSR0871390 U IL
[9]  
EGYED P, 1989, 5TH P ANN ACM S COMP, P364
[10]  
GOODMAN JE, 1988, J AM MATH SOC, V1