Abstract
A fast algorithm for the Voronoi diagram is proposed along with the performance evaluation by extensive computational experiments. It is shown that the proposed algorithm runs in linear time on the average. The algorithm is of incremental type, which modifies the diagram step by step by adding points (generators) one by one. What is new is a special preprocessing procedure for determining the order in which the generators are to be added, where we make use of a quaternary tree combined with an elaborate technique of "bucketing".
