We describe a concise representation for adaptive diamond-kite meshes based solely on the vertices and their stars. The representation is exact because it uses only integers, is …
We develop the theory of the edge coloring of infinite lattice graphs, proving a necessary and sufficient condition for a proper edge coloring of a patch of a lattice graph to induce a …
JES Sánchez, A Medeiros… - Anais Estendidos do …, 2021 - sol.sbc.org.br
The thesis describes a simple integer-based computational representation for periodic tilings of regular polygons using complex numbers, which is now the state of the art for these …
LH de Figueiredo - Code at github. com/lhf/hex, 2024 - lhf.impa.br
We propose a concise representation for adaptive hexagonal meshes that is based solely on the faces. We represent each face by its position, type, orientation, and scale. Although …
D Goncharov, M Michelen, U Nguyen - archive.bridgesmathart.org
We automate the process of constructing an origami crease pattern based on certain planar tilings. In particular, our computer program can take in any 𝑘-uniform tiling and output a …
En la plática, describiré una representación simple y entera para las teselaciones periódicas con polígonos regulares usando números complejos, actual estado del arte de …