Chain Code P System Generating a Variant of the Peano Space-Filling Curve
Generation of the finite approximations of the well-known Hilbert and Peano space-filling curves, represented as chain-code words has been studied in an earlier work. The generation was done with parallel chain code P systems with objects as chain code words and rewriting with context-free rules in parallel. Continuing this line of work, finite approximations of a variant of the Peano curve considered by Wunderlich are generated here with parallel chain code P system. We also generate approximating polygons corresponding to the Peano curve with parallel chain code P system.
We thank the anonymous referees for their valuable suggestions and comments which greatly helped to improve the paper.
- 2.Ceterchi, R., Nagar, A.K., Subramanian, K.G.: Approximating polygons for space-filling curves generated with P systems. In: Graciani, C., Riscos-Núñez, A., Păun, G., Rozenberg, G., Salomaa, A. (eds.) Enjoying Natural Computing. LNCS, vol. 11270, pp. 57–65. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00265-7_5CrossRefGoogle Scholar
- 4.Dassow, J., Habel, A., Taubenberger, S.: Chain-code pictures and collages generated by hyperedge replacement. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 412–427. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61228-9_102CrossRefzbMATHGoogle Scholar
- 15.Subramanian, K.G., Venkat, I., Pan, L.: P systems generating chain code picture languages. In: Proceedings of Asian Conference on Membrane Computing, pp. 115–123 (2012)Google Scholar