Incremental Construction of Generalized Voronoi Diagrams on Pointerless Quadtrees

Table 2

A comparison of the memory cost (in megabyte) of the proposed algorithm to its counterparts. The sizes of the underlying maps are set as 2^𝑁×2^𝑁, where 𝑁 ranges from 7 to 13.

Algorithm	𝑁=7	8	9	10	11	12	13
DB
Obst	0.06251	0.25002	1.00013	4.00001	16.00021	64.00011	256.00032
Voro	0.01562	0.0625	0.25003	1.00000	4.00005	16.00002	64.00012
bRaise	0.01561	0.0625	0.25007	1.00001	4.00000	16.00002	64.00008
BL
Voro	0.01562	0.0625	0.25003	1.00000	4.00005	16.00002	64.00012
bRaise	0.01561	0.0625	0.25007	1.00001	4.00000	16.00002	64.00008
PQ-GVD builder
Obst	0.080097	0.187626	0.459812	0.767155	1.900394	2.352141	6.338497
Voro	0.139286	0.316853	0.796131	1.277332	3.168629	5.103362	8.326475
bRaise	0.000034	0.000034	0.000034	0.000034	0.000034	0.000034	0.000034