论文信息 - A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing

A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing

Malgre la complexite dans le pire des cas de O(n 2 ), l'algorithme incremental quaternaire permet de construire le diagramme de Voronoi pour n generateurs en un temps O(n) en moyenne. En considerant le temps d'execution et la facilite de codage, on recommande la structure de donnees complete, si l'espace le permet, plutot que la structure compacte

Kazuo Murota | Takao Ohya | Masao Iri

[1] Hiroshi Imai,et al. Voronoi Diagram in the Laguerre Geometry and its Applications , 1985, SIAM J. Comput..

[2] Bruce W. Weide,et al. Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.

[3] Kazuo Murota,et al. IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS , 1984 .

[4] Kazuo Murota,et al. Heuristics for planar minimum-weight perfect metchings , 1983, Networks.

[5] D. T. Lee,et al. Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..

[6] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[7] Robin Sibson,et al. Computing Dirichlet Tessellations in the Plane , 1978, Comput. J..