DocumentCode
2991445
Title
Cellular automata and discrete geometry
Author
Debled-Rennesson, Isabelle ; Margenstern, Maurice
Author_Institution
ADAGIo Team, Nancy Univ., Vandceuvre-les-Nancy, France
fYear
2011
fDate
4-8 July 2011
Firstpage
780
Lastpage
786
Abstract
In this paper, we look at the possibility to implement the algorithm to construct a discrete line devised by the first author in cellular automata. It turns out that such an implementation is feasible.
Keywords
cellular automata; computational geometry; cellular automata; discrete geometry; discrete line; Automata; Equations; Geometry; Mathematical model; Radio frequency; Transforms; Writing; cellular automata; discrete geometry; naive discrete line; von Neumann neighbourhood;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Computing and Simulation (HPCS), 2011 International Conference on
Conference_Location
Istanbul
Print_ISBN
978-1-61284-380-3
Type
conf
DOI
10.1109/HPCSim.2011.5999908
Filename
5999908
Link To Document