Chemical processor for computation of Voronoi diagram

Advanced Materials for Optics and Electronics

Volumn 6, Issue 4, 1996, Pages 191-196

  Tolmachiev, Dmitrii ^a   Adamatzky, Andrew ^b  

^a Prikladnaya Khimiya Russian Scientific Center   (Russian Federation)

^b ST PETERSBURG STATE UNIVERSITY   (Russian Federation)

Author keywords

Cellular automata; Computational geometry; Molecular computers

Indexed keywords

APPROXIMATION THEORY; AUTOMATA THEORY; CHEMICAL REACTIONS; DIFFUSION; PALLADIUM; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; POTASSIUM COMPOUNDS; THIN FILMS;

AGAR PALLADIUM THIN LAYER; CELLULAR AUTOMATA; CHEMICAL PROCESSOR; COLLISION FREE MOTION PLANNING; FINITE SET OF PLANAR POINTS; MOLECULAR COMPUTERS; POTASSIUM IODIDE LIQUID; REACTION DIFFUSION ALGORITHMS; SPATIAL DISTRIBUTION; VORONOI DIAGRAM;

COMPUTATIONAL GEOMETRY;

EID: 0030198169     PISSN: 10579257     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-0712(199607)6:4<191::AID-AMO238>3.0.CO;2-G     Document Type: Article

References (35)

1. L. Kuhnert, Photochemische Manipulation von chemischen Wellen, Naturwissenschaften, 1986, 76, 96-97.
2. N. G. Rambidi, D. S. Chernavsky, V. N. Krinsky, V. M. Nikolaenko, O. V. Gritzenko, D. I. Sidel'nikov and A. P. Simonova, Non-discrete biomolecular informational and logical devices: physical principles and possible ways to construction, in Physical and Mathematical Models of Neural Networks, Vol. 5, VINITI, Moscow, 19XX, pp. 49-178 (in Russian).
3. A. I. Adamatzky, Local parallel constructing of Voronoi diagram, Electron. Model., 1992, 1, 26-29 (in Russian).
4. A. I. Adamatzky, Massively parallel algorithms for inverting Voronoi diagram, Neural Netw. World, 1993, 5, 385-392.
5. A. I. Adamatzky, Neural algorithm for constructing minimum spanning tree of a finite planar set, Neural Netw. World, 1992, 6, 335-339.
6. A. I. Adamatzky, Reaction-diffusion algorithm for constructing discrete generalised Voronoi diagram, Neural Netw. World, 1994, 994, 6, 635-643.
7. A. I. Adamatzky, Voronoi-like partition of lattice in cellular automata, Math. Comput. Model., 1996, 23, 51-66.
8. A. I. Adamatzky, Computation of shortest path in cellular automata, Math. Comput. Model., 1996, 23, 105-113.
9. A. I. Adamatzky, Computation of discrete hull in homogeneous automata networks, Neural Netw. World, 1995, 3, 241-254.
10. A. I. Adamatzky, Computation in living systems. A paradigm of reaction-diffusion algorithms, White Papers, ACM Symp. TOC'95, NSF TOC Program Session, 1995.
11. A. Adamatzky, Identification of Cellular Automata, Taylor and Francis, London, 1994.
12. G. Voronoi, Nouvelles applications des paramètres continus à la théorie des formes quadratiques; deuxème mémoire: recherches sur les paralleloèdres primitifs, J. R. Angew. Math., 1908, 134, 198-287.
13. C. O'Dunlaing and C. Yap, A 'retraction' method for planning the motion of a disc, J. Algorithms, 1985, 6, 104-111.
14. D. Leven and M. Shairir, Planning purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagram, Discrete Comput. Geom., 1987, 2, 9-37.
15. A. Aggarwal, L. J. Guibas, J. Saxe and P. W. Shor, A linear-time algorithm for computing the Voronoi diagram of a convex polygon, Discrete Comput. Geom., 1989, 4, 591-604.
16. C. K. Yap, An O(n log Jn) algorithm for the Voronoi diagram of a set of simple curve segments, Discrete Comput. Geom., 1987, 2, 365-393.
17. S. Stifter, An axiomatic approach to Voronoi-diagrams in 3D, J. Comput. Syst. Sci., 1991, 43, 361-379.
18. 1(L∞) metrics with 2-dimensional storage applications, SIAM J. Comput., 1980, 9, 200-211.
19. D. T. Lee, Two-dimensional Voronoi diagram in L metric, J. ACM, 1980, 27, 604-618.
20. R. Klein, On a generalization of planar Voronoi diagrams, Habilitations-schrift, Albert-Ludwigs-Universithät, Freiburg, 1988.
21. R. Klein, Voronoi diagrams in the Moscow metric (extended abstract), in J. van Leeuwen (ed.), Graphtheoretic Concepts in Computer Science (WG'88), Springer, 1988, pp. 434-441.
22. R. Klein, Abstract Voronoi diagrams and their applications, in H. Nolteimer (ed.), Computational Geometry and Its Applications (CG'88), Wurzburg, 1988, pp. 148-157.
23. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer, Berlin, 1985.
24. H. Edelsbrunner, Algorithms in Computational Geometry, Springer, Berlin, 1987.
25. S. Fortune, A sweepline algorithm for Voronoi diagrams, Algorithmica, 1987, 2, 153-174.
26. M. S. Chang, N.-F. Huang and C.-J. Tang, An optimal algorithm for constructing oriented Voronoi diagrams and geographic neighborhood graphs, Info. Process. Lett., 1990, 35, 255-260.
27. D. J. Evans and I. Stoimenovic, On parallel computation of Voronoi diagrams, Parallel Comput., 1989, 12, 121-125.
28. C. S. Jeong and D. T. Lee, Parallel geometric algorithms on a mesh-connected computer, Algorithmica, 1990, 5, 155-177.
29. B. Chazelle, Computational geometry on a systolic chip, IEEE Trans. Comput., 1984, C-33, 774-785.
30. H. J. A. M. Heijmans and C. Ronse, The algebraic basis of mathematical morphology. I. Dilation and erosion, Comput. Vision Graphics Image Process., 1990, 50, 245-295.
31. H. J. A. M. Heijmans, Morphological Image Operators, Academic, Boston, MA, 1994.
32. E. Banks, Information processing and transmission in cellular automata, MAC TR-81, MIT Project, 1971.
33. V. A. Karasev, V. V. Luchinin and V. E. Stefanov, A model of molecular electronics based on the concept of conjugated ionic-hydrogen bond systems, Ad. Mater. Opt. Electron., 1994, 4, 203-218.
34. E. Fredkin and T. Toffoli, Conservative logic, Int. J. Theor. Phys., 1982, 21, 219-253.
35. +-media, Adv. Mater. Opt. Electron., 1995, 5, 145-155.