VORONOI DIAGRAMS AND ARRANGEMENTS

被引：200
作者：
EDELSBRUNNER, H
SEIDEL, R
机构：
[1] CORNELL UNIV, DEPT COMP SCI, ITHACA, NY 14853 USA
[2] GRAZ TECH UNIV, INST INFORMAT VERARBEITUNG, A-8010 GRAZ, AUSTRIA
来源：
DISCRETE & COMPUTATIONAL GEOMETRY | 1986年 / 1卷 / 01期
关键词：
D O I：
10.1007/BF02187681
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：25 / 44
页数：20
相关论文
共 35 条
[1]  
ASH FP, IN PRESS GENERALIZED
[2]   AN OPTIMAL ALGORITHM FOR CONSTRUCTING THE WEIGHTED VORONOI DIAGRAM IN THE PLANE [J].
AURENHAMMER, F ;
EDELSBRUNNER, H .
PATTERN RECOGNITION, 1984, 17 (02) :251-257
[3]  
AURENHAMMER F, 1983, F120 IIG TU GRAZ REP
[4]  
BHATTACHARYA B, 1983, TR839 S FRAS U CS DE
[5]   COMPUTING DIRICHLET TESSELLATIONS [J].
BOWYER, A .
COMPUTER JOURNAL, 1981, 24 (02) :162-166
[6]   VORONOI DIAGRAMS FROM CONVEX HULLS [J].
BROWN, KQ .
INFORMATION PROCESSING LETTERS, 1979, 9 (05) :223-228
[7]  
BROWN KQ, 1978, CMUCS78129 CS DEP RE
[8]  
BROWN KQ, 1980, CMUCS80101 CS DEP RE
[9]  
CHEW LP, 1985, P 1 ANN ACM S COMP G, P235
[10]  
Cole R., 1983, 24th Annual Symposium on Foundations of Computer Science, P112, DOI 10.1109/SFCS.1983.22
1234