REPORTING AND COUNTING SEGMENT INTERSECTIONS

被引:36
作者
CHAZELLE, B
机构
关键词
D O I
10.1016/0022-0000(86)90025-5
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:156 / 182
页数:27
相关论文
共 12 条
[1]  
BENTLEY JL, 1979, IEEE T COMPUT, V28, P643, DOI 10.1109/TC.1979.1675432
[2]  
BENTLEY JL, 1980, IEEE T COMPUT, V29, P571, DOI 10.1109/TC.1980.1675628
[3]   ALGORITHMS FOR REPORTING AND COUNTING GEOMETRIC INTERSECTIONS - COMMENTS [J].
BROWN, KQ .
IEEE TRANSACTIONS ON COMPUTERS, 1981, 30 (02) :147-148
[4]  
EDELSBRUNNER H, 1983, IIG111 TU GRAZ REP
[5]  
EDELSBRUNNER H, UNPUB OPTIMAL POINT
[6]  
Guibas L., 1983, 24th Annual Symposium on Foundations of Computer Science, P100, DOI 10.1109/SFCS.1983.1
[7]  
GUIBAS LJ, 1983, 15TH P ANN ACM S THE, P221
[8]   OPTIMAL SEARCH IN PLANAR SUBDIVISIONS [J].
KIRKPATRICK, D .
SIAM JOURNAL ON COMPUTING, 1983, 12 (01) :28-35
[9]  
MAIRSON HG, UNPUB REPORTING COUN
[10]  
Muller D. E., 1978, Theoretical Computer Science, V7, P217, DOI 10.1016/0304-3975(78)90051-8