Incremental Construction of Generalized Voronoi Diagrams on Pointerless Quadtrees

Algorithm 4

Pseudocode for approximations.

Approximation (layer, changeArea)

77. 𝑟𝑎𝑛𝑔𝑒← 2^layer

78. for each 𝑖 from 0 to range

79.  for each 𝑗 from 0 to range

80.   if (𝑖,𝑗) is in changeArea

81. 𝑠← 𝑉𝑜𝑟𝑜.QueryANode(𝑚(layer; 𝑖, 𝑗))

82. if  𝑠.state = gray or 𝑠.sate = true

83.  𝑏← 𝑡𝑟𝑢𝑒

84.  roughtEQueue.push((𝑙𝑎𝑦𝑒𝑟;𝑖,𝑗))

85. else  𝑏← 𝑓𝑎𝑙𝑠𝑒

86. 𝐴𝑝𝑝𝑟𝑜𝑉𝑜𝑟𝑜[𝑖][𝑗]← 𝑏