Title :
When algorithms became local: solving computational geometry problems on neural networks
Author :
Adamatzky, Andrew I.
Author_Institution :
Dept. of Biophys., Sankt-Petersburg Univ., Russia
Abstract :
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
Keywords :
cellular automata; computational geometry; graph theory; mesh generation; neural nets; parallel algorithms; Delaunay triangulation; Gabriel graph; Voronoi diagram; cellular automata processor; computational geometry; finite planar set; influence graph; local parallel algorithms; minimal spanning tree; neural networks; relative neighborhood graph; Artificial neural networks; Biophysics; Computational geometry; Computer architecture; Computer networks; Concurrent computing; Neural networks; Parallel algorithms; Testing; Tree graphs;
Conference_Titel :
Neuroinformatics and Neurocomputers, 1992., RNNS/IEEE Symposium on
Conference_Location :
Rostov-on-Don
Print_ISBN :
0-7803-0809-3
DOI :
10.1109/RNNS.1992.268524
