A note on peano polygons and gray codes
- 1 January 1985
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 18 (1) , 3-13
- https://doi.org/10.1080/00207168508803475
Abstract
Explicit mappings from the first n2p base n Gray code integers into the ordered vertices of the pth Peano polygon and vice versa are derived. The result is generalised to r-dimensional Peano polygons. Algorithms to achieve the transformations directly are discussed.Keywords
This publication has 5 references indexed in Scilit:
- On the generation and use of space‐filling curvesSoftware: Practice and Experience, 1983
- Short algorithms for space‐filling curvesSoftware: Practice and Experience, 1981
- On certain crinkly curvesTransactions of the American Mathematical Society, 1900
- Ueber die stetige Abbildung einer Line auf ein Fl chenst ckMathematische Annalen, 1891
- Sur une courbe, qui remplit toute une aire planeMathematische Annalen, 1890