ON A CIRCLE PLACEMENT PROBLEM

被引:55
作者
CHAZELLE, BM [1 ]
LEE, DT [1 ]
机构
[1] NORTHWESTERN UNIV,DEPT ELECT ENGN & COMP SCI,EVANSTON,IL 60201
关键词
D O I
10.1007/BF02238188
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:1 / 16
页数:16
相关论文
共 9 条
[1]  
BAJAJ C, 1983, 21ST P ANN ALL C 198, P459
[2]  
BENTLEY JL, 1979, IEEE T COMPUT, V28, P643, DOI 10.1109/TC.1979.1675432
[3]  
CHAZELLE BM, UNPUB BIT
[4]  
DREZNER Z, 1981, MANAGE SCI, V27, P838
[5]  
EDELSBRUNNER H, UNPUB SIAM J COMPUT
[6]   FINDING THE CONNECTED COMPONENTS AND A MAXIMUM CLIQUE OF AN INTERSECTION GRAPH OF RECTANGLES IN THE PLANE [J].
IMAI, H ;
ASANO, T .
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1983, 4 (04) :310-323
[7]  
Lee D. T., 1983, ADV COMPUTING RES, V1, P91
[8]  
Muller D. E., 1978, Theoretical Computer Science, V7, P217, DOI 10.1016/0304-3975(78)90051-8
[9]  
Preparata FP, 2012, COMPUTATIONAL GEOMET