Cellular Automata and Discrete Geometry

TL;DR

This paper explores implementing a discrete line construction algorithm within cellular automata, demonstrating the feasibility of such an approach for discrete geometric computations.

Contribution

It introduces a method to realize a discrete line algorithm in cellular automata, bridging discrete geometry and automata theory.

Findings

Implementation of the discrete line algorithm in cellular automata is feasible.

The approach demonstrates potential for cellular automata in discrete geometric tasks.

Provides a foundation for further research in automata-based geometric algorithms.

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.