COMPUTING A HAM-SANDWICH CUT IN 2 DIMENSIONS

被引:28
作者
EDELSBRUNNER, H [1 ]
WAUPOTITSCH, R [1 ]
机构
[1] GRAZ TECH UNIV,INST INFORMAT PROCESSING,A-8010 GRAZ,AUSTRIA
关键词
D O I
10.1016/S0747-7171(86)80020-7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:171 / 178
页数:8
相关论文
共 9 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]  
ATALLAH MJ, 1983, J COMP SYST SCI
[3]  
COLE R, 1984, 16TH P ANN SIGACT S, P154
[4]  
COLE R, 1984, 25TH P ANN IEEE S FO, P225
[5]  
Dobkin D. P., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P387, DOI 10.1109/SFCS.1984.715939
[6]   Edge-Skeletons in Arrangements with Applications [J].
Edelsbrunner, H. .
ALGORITHMICA, 1986, 1 (1-4) :93-109
[7]  
EDELSBRUNNER H, 1983, UNPUB INF P LETT
[8]   PARTITIONING WITH 2 LINES IN THE PLANE [J].
MEGIDDO, N .
JOURNAL OF ALGORITHMS, 1985, 6 (03) :430-433
[9]   POLYGON RETRIEVAL [J].
WILLARD, DE .
SIAM JOURNAL ON COMPUTING, 1982, 11 (01) :149-165