Slime mould computes planar shapes

International Journal of Bio-Inspired Computation

Volumn 4, Issue 3, 2012, Pages 149-154

  Adamatzky, Andrew ^a  

^a UNIVERSITY OF THE WEST OF ENGLAND   (United Kingdom)

Author keywords

Alpha shape; Concave hull; Convex hull; Physarum polycephalum; Unconventional computing

Indexed keywords

COMPUTATIONAL GEOMETRY;

ALPHA-SHAPES; CONCAVE HULL; CONVEX HULL; PHYSARUM POLYCEPHALUM; UNCONVENTIONAL COMPUTING;

MOLDS;

EID: 84862198948     PISSN: 17580366     EISSN: 17580374     Source Type: Journal    
DOI: 10.1504/IJBIC.2012.047239     Document Type: Article

References (34)

1. Adamatzky, A. (1994) Identification of Cellular Automata, Chapter 4, Section 4.7.2, Taylor & Francis, London.
2. Adamatzky, A. (2007a) 'Physarum machine: implementation of a Kolmogorov-Uspensky machine on a biological substrate', Parallel Process Lett., Vol. 17, pp.455-467. (Pubitemid 351143363)
3. Adamatzky, A. (2007b) 'Physarum machines: encapsulating reaction-diffusion to compute spanning tree', Naturwisseschaften, Vol. 94, pp.975-980. (Pubitemid 350160014)
4. Adamatzky, A. (2010a) 'Physarum machines: making computers from slime mould', World Scientific.
5. Adamatzky, A. (2010b) 'Slime mould logical gates: exploring ballistic approach', available at http://arxiv.org/abs/1005.2301 (accessed on 2010).
6. Adamatzky, A. (2011) 'On attraction of slime mould physarum polycephalum to plants with sedative properties', available at http://precedings.nature.com/ users/ffceae4bf59a659b3a00cc00e3938f44.
7. Akl, S.G. and Toussaint, G.T. (1978) 'A fast convex hull algorithm', Inform Process Lett., Vol. 7, pp.219-222.
8. Chen, W., Nakano, K. and Wada, K. (2000) 'Parallel algorithms for convex hull problems and their paradigm', IEICE Trans. Information and Syst., Vol. E83-D, pp.519-529.
9. Clarridge, A.G. and Salomaa, K. (2010) 'An improved cellular automata based algorithm for the 45-convex hull problem', J of Cellular Automata, Vol. 5, pp.107-120.
10. Day, A.M. and Tracey, D. (1998) 'Parallel implementations for determining the 2D convex hull', Concurrency Practice and Experience, Vol. 10, pp.449-466. (Pubitemid 128445428)
11. de Berg, M., Cheong, O., van Kreveld, M. and Overmars, M. (2008) Computational Geometry: Algorithms and Applications, Springer, New York.
12. Dehne, F., Hassenklover, A.L., Sack, J.R. and Santoro, N. (1991) 'Computation geometry algorithms for the systolic screen', Algorithmica, Vol. 6, pp.734-761. (Pubitemid 21738153)
13. Edelsbrunner, H. and M'uke, E.P. (1994) 'Three-dimensional alpha shapes', ACM Trans on Graphics, Vol. 13, pp.43-72.
14. Edelsbrunner, H., Kirkpatrick, D. and Seidel, R. (1983) 'On the shape of a set of points in the plane', IEEE Trans Inform Theor., Vol. 29, No. 4, pp.551-559.
15. Evans, D.J. and Mai, S-W. (1985)'Two parallel algorithms for the convex hull problem in a two dimensional space', Parallel Comput., Vol. 2, pp.313-326. (Pubitemid 16502828)
16. Field, R.J. and Noyes, R.M. (1974) 'Oscillations in chemical systems', J. Chem. Phys., Vol. 60, pp.1877-1884.
17. Graham, R.L. (1972) 'An efficient algorithm for determining the convex hull of a finite planar set', Inform Process Lett., Vol. 1, pp.132-133.
18. Hayashi, T., Nakano, K. and Olariu, S. (1998) 'Optimal parallel algorithms for finding proximate points, with applications', IEEE Trans. Parall. Dist. Syst., Vol. 9, pp.1153-1166. (Pubitemid 128744924)
19. Jarvis, R. (1973) 'On the identification of the convex hull of a finite set of points in the plane,' Inform Process Lett., Vol. 2, pp.18-21.
20. Kamiya, N. (1959) 'Protoplasmic streaming', Protoplasmatologia, Vol. 8, pp.1-199, Cited by Tero, A., Kobayashi, R. and Nakagaki, T.
21. Kim, C.E. and Stojmenovic, I. (1995) 'Sequential and parallel approximate convex hull algorithms', Computers and AI, Vol. 14, pp.597-610. (Pubitemid 126034010)
22. Nakagaki, T., Yamada, H. and Toth, A. (2001) 'Path finding by tube morphogenesis in an amoeboid organism', Biophysical Chemistry, Vol. 92, pp.47-52. (Pubitemid 32799125)
23. Nakagaki, T., Yamada, H. and Ueda, T. (2000) 'Interaction between cell shape and contraction pattern in the Physarum plasmodium', Biophys. Chemy., Vol. 84, pp.195-204. (Pubitemid 30254313)
24. O'Rourke, J. (2001) Computational Geometry in C, Cambridge University, Cambridge.
25. Preparata, F.P. and Hong, S.J. (1977) 'Convex hulls of finite sets of points in two and three dimensions', Commun. ACM, Vol. 20, pp.87-93.
26. Preparata, F.P. and Shamos, M.I. (1985) Computational Geometry: An Introduction, Springer-Verlag New York Inc.
27. Schumann, A. and Adamatzky, A. (2009) 'Physarum spatial logic', in Proc. 1st Int. Symp. on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, 26-29 September.
28. Shirakawa, T., Adamatzky, A., Gunji, Y-P. and Miyake, Y. (2009) 'On simultaneous construction of Voronoi diagram and Delaunay triangulation by Physarum polycephalum', Int. J. Bifurcation and Chaos, Vol. 19, pp.3109-3117.
29. Stephenson, S.L. and Stempen, H. (2000) Myxomycetes: A Handbook of Slime Molds, Timber Press.
30. Tero, A., Kobayashi, R. and Nakagaki, T. (2007) 'A mathematical model for adaptive transport network in path finding by true slime mold', J of Theor. Biol., Vol. 244, pp.553-564. (Pubitemid 46148964)
31. Torbey, S. and Akl, S.G. (2008) 'An exact and optimal local solution to the two-dimensional convex hull of arbitrary points problem', J. of Cellular Automata.
32. Tsuda, S., Aono, M. and Gunji, Y-P. (2004) 'Robust and emergent Physarum logicalcomputing', Biosystems, Vol. 73, pp.45-55.
33. Tyson, J.J. and Fife, P.C. (1980) 'Target patterns in a realistic model of the BelousovZhabotinskii reaction', J. Chem. Phys., Vol. 73, pp.2224-2437.
34. Ueda, T., Muratsugu, M., Kurihara, K. and Kobatake, Y. (1976) 'Chemotaxis in Physarum polycephalumnext term: effects of chemicals on isometric tension of the plasmodial strand in relation to chemotactic movement', Experimental Cell Research, Vol. 100, pp.337-344.