|
1. Description
This example solves the Voronoi diagram problem using the cellular automata model. The Voronoi diagram is the nearest-neighbor map for a set of input sites. Each region in this map contains those points that are nearer one input site than any other sites.
In this example, the rule set will partition CA space into regions centered by the initial input sites marked by '*', forming a graph similar to the Voronoi diagram in computational geometry problems. Note that distance is computed in this system as Dist(P,Q)=Max(|Px-Qx|,|Py-Qy|), NOT by the usual Cartesian metric.
2. Download
next example
|
