Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-12797-8_6 | Int. Conf. on Membrane Computing |
Field | DocType | Citations |
Discrete mathematics,Polygon,Peano axioms,Peano curve,Approximations of π,Rewriting,Space-filling curve,Mathematics,Chain code,P system | Conference | 0 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rodica Ceterchi | 1 | 119 | 17.38 |
| Atulya K. Nagar | 2 | 689 | 104.26 |
| K. G. Subramanian | 3 | 339 | 59.27 |