Abstract
<jats:p>In this article, a new Voronoi diagram algorithm with rectangular sites and holes is proposed. The algorithm is based on the existing Voronoi diagram algorithm with the L∞ distance metric by Papadopoulou E. and Lee D.-T. The new modifications of the Voronoi diagram model include the holes processing mechanisms. The algorithm handles the distortions in the diagram structure from the holes by using layers in the Voronoi front called shadows and a new type of bisectors that do not build any Voronoi edge in the diagram, but maintain the layers of the front. The algorithm defines new events for a sweep line, keeping the general processing in the same manner as the base algorithm. According to the results of time consumption comparison with the previous span determination algorithm, the proposed algorithm executes from 1.33 times faster for 75 supports up to 15.17 times faster for the largest number of supports tested, but is slower for fewer supports and more holes. The preliminary correlation analysis showed a significant correlation of 0.76 between the area of the Voronoi cell and the amount of reinforcement required, as well as strong and moderate correlation between other parameters of the cell and deformation metrics. The conclusion outlines the current limitations of the model and algorithm for future research.</jats:p>