𝔖 Bobbio Scriptorium
✦   LIBER   ✦

3D surface cellular automata and their applications

✍ Scribed by Gobron, Stéphane (author);Chiba, Norishige (author)

Publisher
John Wiley and Sons Ltd
Year
1999
Tongue
English
Weight
570 KB
Volume
10
Category
Article
ISSN
1049-8907

No coin nor oath required. For personal study only.

✦ Synopsis

This paper describes the generation and rendering of three-dimensional (3D) surface cellular automata (CA). Our model's main advantage is that it gives direct texturing simulation based on the actual shape of any triangulated input object. We first introduce general CA concepts and summarize works in the literature. We then describe our 3D surface CA method, emphasizing how it avoids potential problems in data structure and rendering steps. We then detail, two examples of specific 3D

surface CA with their respective cell structures and corresponding computer graphics images.

📜 SIMILAR VOLUMES

Linear speed-up for cellular automata sy
Linear speed-up for cellular automata synchronizers and applications
✍ Olivier Heen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 816 KB

Simple cellular automata can be used as language recognizers or function calculators. There exist several proofs of the linear speed-up theorem in strong form for rccognizers [7,6, 1 l] but not for calculators. In this paper we design a linear speed-up method for a special kind of calculators, namel

Some applications of propositional logic
Some applications of propositional logic to cellular automata
✍ Stefano Cavagnetto 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract In this paper we give a new proof of Richardson's theorem [31]: a global function __G__~𝔸~ of a cellular automaton 𝔸 is injective if and only if the inverse of __G__~𝔸~ is a global function of a cellular automaton. Moreover, we show a way how to construct the inverse cellular automaton