THE POWER OF GEOMETRIC DUALITY

被引：145
作者：
CHAZELLE, B
GUIBAS, LJ
LEE, DT
机构：
[1] BROWN UNIV,DEPT COMP SCI,PROVIDENCE,RI 02912
[2] XEROX CORP,PALO ALTO RES CTR,COMP SCI LAB,PALO ALTO,CA 94304
来源：
BIT | 1985年 / 25卷 / 01期
关键词：
D O I：
10.1007/BF01934990
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：76 / 90
页数：15
相关论文
共 18 条
[1]  
BROWN KQ, 1979, THESIS CARNEGIEMELLO
[2]  
Chazelle B., 1983, 24th Annual Symposium on Foundations of Computer Science, P122, DOI 10.1109/SFCS.1983.17
[3]  
CHAZELLE B, 1983, CS8313 BROWN U TECHN
[4]  
CHAZELLE B, 1980, 12TH P ANN ACM S THE, P146
[5]   POLYGONAL INTERSECTION SEARCHING [J].
EDELSBRUNNER, H ;
MAURER, HA ;
KIRKPATRICK, DG .
INFORMATION PROCESSING LETTERS, 1982, 14 (02) :74-79
[6]  
Edelsbrunner H., 1983, 24th Annual Symposium on Foundations of Computer Science, P83, DOI 10.1109/SFCS.1983.11
[7]  
EDELSBRUNNER H, 1983, COMMUNICATION JUN
[8]  
EDELSBRUNNER H, 1982, F98 TU GRAZ TECH REP
[9]  
EDELSBRUNNER H, 1983, F111 TU GRAZ TECH RE
[10]   TRIANGULATING A SIMPLE POLYGON [J].
GAREY, MR ;
JOHNSON, DS ;
PREPARATA, FP ;
TARJAN, RE .
INFORMATION PROCESSING LETTERS, 1978, 7 (04) :175-179
12