DOI: 10.1007/978-3-540-79992-4_19
|View full text |Cite
|
Sign up to set email alerts
|

On the Collision-Propagation and Gather-Update Formulations of a Cellular Automata Rule

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…Lattice-gas cellular automata (LGCA) are a particular case of CA, historically designed to simulate fluid dynamics, used in numerous applications from crowds dynamics [17] to cellular motion [8]. They rely on the representation of particles that travel through the lattice according to the successive application of the interaction step (I) -which reorganises particles within cells -and the propagation step (P) -which displaces particles towards the corresponding neighbours.…”
Section: Introductionmentioning
confidence: 99%
“…Lattice-gas cellular automata (LGCA) are a particular case of CA, historically designed to simulate fluid dynamics, used in numerous applications from crowds dynamics [17] to cellular motion [8]. They rely on the representation of particles that travel through the lattice according to the successive application of the interaction step (I) -which reorganises particles within cells -and the propagation step (P) -which displaces particles towards the corresponding neighbours.…”
Section: Introductionmentioning
confidence: 99%
“…The collision-propagation terminology is borrowed from the lattice gas automata framework (for example, see [4]), and has recently been shown to be equivalent to other update paradigms [5].…”
Section: Complex Automata Modellingmentioning
confidence: 99%