Points Distances and Cellular Automata: Geometric and Spatial Algorithmics

Luidnel Maignan

Description

Points, Distances, and Cellular Automata: Geometric and Spatial Algorithmics Points, Distances, and Cellular Automata: Geometric and Spatial Algorithmics Luidnel Maignan Alchemy: INRIA Saclay, LRI, Univ. Paris XI New World of Computation 2011 Orlean - 23-24 May 2011 1 / 45

• spatial algorithmics


• luidnel maignan


• cellular automata


• massively distributed


• systems ?

Sujets

• Cellular automaton

Informations

• Publié par: pefav
• Nombre de lectures: 57
• Langue: English
• Poids de l'ouvrage: 1 Mo

Extrait

Points, Distances, and Cellular Automata: Geometric and Spatial Algorithmics
Points, Distances, and Cellular Automata:
Geometric and Spatial Algorithmics
Luidnel Maignan
Alchemy: INRIA Saclay, LRI, Univ. Paris XI
[e-mail]
New World of Computation 2011
Orl´ean - 23-24 May 2011
1/45Points, Distances, and Cellular Automata: Geometric and Spatial Algorithmics
Introduction
Spatial Computing and Cellular Automata
Massively Distributed Systems⇒ Spatial Features
2/45Points, Distances, and Cellular Automata: Geometric and Spatial Algorithmics
Introduction
Spatial Computing and Cellular Automata
Massively Distributed Systems⇒ Spatial Features
Why? Physics and Locality
2/45Points, Distances, and Cellular Automata: Geometric and Spatial Algorithmics
Introduction
Spatial Computing and Cellular Automata
Massively Distributed Systems⇒ Spatial Features
Why? Physics and Locality
Exemple? Computer Architecture, Communication
2/45Points, Distances, and Cellular Automata: Geometric and Spatial Algorithmics
Introduction
Spatial Computing and Cellular Automata
Spatial Computing: focus on space
Cellular Automata: simple framework, precise results
3/45Points, Distances, and Cellular Automata: Geometric and Spatial Algorithmics
Global Statement
In the same manner that geometry is deeply based on distances,
basing spatial algorithmics on the intrinsic metric of the spatial
computers leads to more precise and generic formulation.
4/45Points, Distances, and Cellular Automata: Geometric and Spatial Algorithmics
Outline
1 Space, Time, and Cellular Automata
2 Distance Fields and Gradients
3 Density Uniformisation
4 Convex Hulls
5 Gabriel graphs
6 Conclusion and Perpectives
5/45Points, Distances, and Cellular Automata: Geometric and Spatial Algorithmics
Space, Time, and Cellular Automata
Space, Time, and
Cellular Automata
6/45Points, Distances, and Cellular Automata: Geometric and Spatial Algorithmics
Space, Time, and Cellular Automata
Classical Considerations
Cellular Automata
Cellular Automata
Regular lattice of cells, also called sites, (or points)
All sites states are updated synchronously
State updates depends only on neighborhood sites states
4-Square 8-Square Hexagonal
7/45Points, Distances, and Cellular Automata: Geometric and Spatial Algorithmics
Space, Time, and Cellular Automata
Classical Considerations
Cellular Automata
Cellular Automata
Regular lattice of cells, also called sites, (or points)
All sites states are updated synchronously
State updates depends only on neighborhood sites states
4-Square 8-Square Hexagonal
7/45