FINDING EXTREME-POINTS IN 3-DIMENSIONS AND SOLVING THE POST-OFFICE PROBLEM IN THE PLANE

被引:17
作者
EDELSBRUNNER, H
MAURER, HA
机构
[1] Technical Univ of Graz, Inst for, Information Processing, Graz,, Austria, Technical Univ of Graz, Inst for Information Processing, Graz, Austria
关键词
COMPUTATIONAL GEOMETRY - MULTI-DIMENSIONAL SEARCHING - POST-OFFICE PROBLEM;
D O I
10.1016/0020-0190(85)90107-3
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:39 / 47
页数:9
相关论文
共 19 条
[1]  
AURENHAMMER F, 1983, F126 TU GRAZ I INF P
[2]   A CONVEX 3-COMPLEX NOT SIMPLICIALLY ISOMORPHIC TO A STRICTLY CONVEX COMPLEX [J].
CONNELLY, R ;
HENDERSON, DW .
MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1980, 88 (SEP) :299-306
[3]  
Davis C., 1959, SCRIPTA MATH, V24, P219
[4]  
Dobkin D. P., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P387, DOI 10.1109/SFCS.1984.715939
[5]  
DOBKIN DP, 1982, LECT NOTES COMPUT SC, V140, P154
[6]  
EDELSBRUNNER H, 1985, TR85669 CORN U DEP C
[7]  
EDELSBRUNNER H, UNPUB SIAM J COMPUT
[8]  
EDELSBRUNNER H, 1985, UNPUB P S COMPUTATIO
[9]  
EDELSBRUNNER H, 1984, F140 TU GRAZ I INF P
[10]  
Grunbaum B, 1967, CONVEX POLYTOPES