An animation of the Sugihara-Iri topology-based voronoi diagram algorithm. The diagram for 100 random point generators is incrementally constructed. As each vertex generator (yellow) is inserted a seed-vertex (pink) is first found. The tree of vertices to be deleted (red) is then expanded maximally. Edges in the tree (red) are deleted, while new voronoi vertices are generated on edges that connect tree-vertices to non-tree vertices (these edges are marked green). Please see Sugihara&Iri 1994 "A robust topology-oriented incremental algorithm for voronoi diagrams" for details.
Link to this comment:
All Comments (0)