When algorithms became local: solving computational geometry problems on neural networks
Andrew Adamatzky · 1992
Optimal local parallel algorithms for computing the Voronoi diagram, Delaunay triangulation, the Gabriel graph, the relative neighborhood graph, the influence graph, the minimal spanning tree, and other structures over a finite planar set are presented. The parallel algorithms offered are intended for realization in a cellular automata processor.>