A SWEEPLINE ALGORITHM FOR VORONOI DIAGRAMS

被引：711
作者：
FORTUNE, S
机构：
来源：
ALGORITHMICA | 1987年 / 2卷 / 02期
关键词：
D O I：
10.1007/BF01840357
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：153 / 174
页数：22
相关论文
共 21 条
[1]   AN OPTIMAL ALGORITHM FOR CONSTRUCTING THE WEIGHTED VORONOI DIAGRAM IN THE PLANE [J].
AURENHAMMER, F ;
EDELSBRUNNER, H .
PATTERN RECOGNITION, 1984, 17 (02) :251-257
[2]   OPTIMAL EXPECTED-TIME ALGORITHMS FOR CLOSEST POINT PROBLEMS [J].
BENTLEY, JL ;
WEIDE, BW ;
YAO, AC .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (04) :563-580
[3]  
CHEW LP, 1985, P 1 ANN ACM S COMP G, P235
[4]  
DRISCOLL J, 1986, 18TH P ANN ACM S THE, P109
[5]  
EDELSBRUNNER H, 1985, COMMUNICATION
[6]  
EDELSBRUNNER H, 1984, OPTIMAL POINT LOCATI
[7]  
FORTUNE SJ, LECTURE NOTES COMPUT, V194, P189
[8]   COMPUTING DIRICHLET TESSELLATIONS IN PLANE [J].
GREEN, PJ ;
SIBSON, R .
COMPUTER JOURNAL, 1978, 21 (02) :168-173
[9]  
Kirkpatrick D. G., 1979, 20th Annual Symposium of Foundations of Computer Science, P18, DOI 10.1109/SFCS.1979.15
[10]   GENERALIZATION OF VORONOI DIAGRAMS IN THE PLANE [J].
LEE, DT ;
DRYSDALE, RL .
SIAM JOURNAL ON COMPUTING, 1981, 10 (01) :73-87
123