6.3 Data Structures



next up previous contents index
Next: 6.3.1 The Dual Doubly Up: 6 VORONOI Re-gridding and Previous: 6.2.4 Scope and Possible

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.





Martin Stiftinger
Thu Oct 13 13:51:43 MET 1994