SEPARATING 2 SIMPLE POLYGONS BY A SEQUENCE OF TRANSLATIONS

被引:42
作者
POLLACK, R [1 ]
SHARIR, M [1 ]
SIFRONY, S [1 ]
机构
[1] TEL AVIV UNIV,SCH MATH SCI,IL-69978 TEL AVIV,ISRAEL
关键词
D O I
10.1007/BF02187902
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:123 / 136
页数:14
相关论文
共 24 条
[1]  
[Anonymous], P 1 ACM S COMP GEOM
[2]  
BHATTACHARYA B, 1986, SOCS861 MCGILL U TEC
[3]  
Chazelle B., 1982, 23rd Annual Symposium on Foundations of Computer Science, P339, DOI 10.1109/SFCS.1982.58
[4]  
Chazelle B., 1983, ADV COMPUTING RES, VI, P1
[5]  
CHEW LP, 1985, P 1 ANN ACM S COMP G, P235
[6]  
EDELSBRUNNER H, 1985, COMMUNICATION
[7]  
FORTUNE SJ, 1985, LECT NOTES COMPUT SC, V194, P189
[8]  
Guibas L., 1983, 24th Annual Symposium on Foundations of Computer Science, P100, DOI 10.1109/SFCS.1983.1
[9]  
Guibas L., 1986, 2ND P ANN ACM S COMP, P1, DOI DOI 10.1145/10515.10516
[10]   NONLINEARITY OF DAVENPORT SCHINZEL SEQUENCES AND OF GENERALIZED PATH COMPRESSION SCHEMES [J].
HART, S ;
SHARIR, M .
COMBINATORICA, 1986, 6 (02) :151-177