6.3 Data Structures

There are two important data structures which are characteristic for VORONOI. It uses a so-called doubly connected edge list [95] to store the Delaunay and Voronoi graphs and a bucket point region quadtree [119] for the fast location of the nodes of the Delaunay graph.

• 6.3.1 The Dual Doubly Connected Edge Lists (DCELs)
  • Access Macros
• 6.3.2 The Bucket Quadtree