Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2202.06656

Forming Point Patterns by a Probabilistic Cellular Automata Rule

Rolf Hoffmann
View original source ↗Read source document ↗Export metadata ↓

Abstract

The objective is to find a Cellular Automata rule that can form a 2D point pattern with a maximum number of points (1-cells). Points are not allowed to touch each other, they have to be separated by 0-cells, and every 0-cell can find at least one point in its Moore-neighborhood. Probabilistic rules are designed that can solve this task with asynchronous updating and cyclic boundary condition. The task is considered as a tiling problem, where point tiles are used to cover the space with overlaps. A point tile consists of a center pixel (the kernel with value 1) and 8 surrounding pixels forming the hull with value 0. The term pixel is used to distinguish the cells of a tile from the cells of a cellular automaton. For each of the 9 tile pixels a so-called template is defined by a shift of the point tile. In the rule application, the 9 templates are tested at the actual cell position. If all template pixels (except the central reference pixel) of a template match with the corresponding neighbors of the actual cell under consideration, the cell's state is adjusted to the reference pixel's value. Otherwise the cell is set to the random value 0 or 1 with a certain probability. The hull pixels are allowed to overlap. In order to evolve a maximum of points, the overlap between tiles has to be maximized. To do that, the number of template hits is counted. Depending on the hit-number, additional noise is injected with certain probabilities. Thereby optimal patterns with the maximum number of points can be evolved. The behavior and performance of the designed rules is evaluated for different parameter settings.

Explore related subjects

cs.CG

Keep this discovery

BibTeXRIS

Rolf Hoffmann. 2022-02-14. Forming Point Patterns by a Probabilistic Cellular Automata Rule. https://arxiv.org/abs/2202.06656

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Almost Linear Universal Point Sets for Planar Graphs

A point set is universal for planar graphs on $n$ vertices if every such graph has a straight-line drawing without crossings whose vertices belong to the set. We construct universal point sets of size $n^{1+o(1)}$, improving the previous quadratic upper bound. Our construction uses the reduction of Bannister, Cheng, Devanny, and Eppstein from universal point sets to superpatterns for $213$-avoiding permutations. We represent these permutations by ordered rooted forests and construct a small family of intervals containing every such forest. The result follows from a straightforward bound on the size of the family of intervals. GPT-6 Astra assisted in developing the construction and proof.

cs.CG↗
arXiv2026

Some results on Archdeacon's conjecture for rotation systems

A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.

cs.CG↗
arXiv2026

The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems

Despite the prominence of hyperbolic surfaces in mathematics, basic algorithmic questions about them, even computing the distance between two points, have remained open, leaving many features of these surfaces inaccessible. The classical machinery assumes a polyhedral structure absent on a smooth surface. We remove these obstacles. We begin with an efficient $O(g^2)$ algorithm for the distance between two points, where $g$ is the genus of the surface. Building on it, we obtain an $O(g^2 \log g)$ method for answering distance queries from a fixed source and, as a consequence, for recentering a Dirichlet domain around an arbitrary point. This understanding of distances on the surface then lets us approximate the diameter to within any $\eps$ in time $O(g^3 \log g / \eps^2)$. We further show that the diameter, a single real number encoding a great deal about the surface, is exactly computable. Its hyperbolic cosine is an algebraic number over the field encoding the coefficients of the hyperbolic isometries defining the surface.

cs.CG↗