Questions tagged [tessellations]

For question on Tessellations, the process of creating a two-dimensional plane using the repetition of a geometric shape with no overlaps and no gaps.

Filter by
Sorted by
Tagged with
6
votes
1answer
78 views

What mapping does Escher use?

In Escher's hyperbolic tesselations, he takes (effectively) a tesselation of the plane and maps it to a tesselation of the unit disk, by a mapping that takes straight lines to circles meeting the disk ...
1
vote
1answer
26 views

Distance labels in regular hyperbolic tilings

Consider the order-4 pentagonal tiling of the hyperbolic plane (shown in the figure Hyperbolic plane tiling with pentagons). Pick a vertex $s$ (in white), label it with $0$ and then label all the ...
6
votes
0answers
49 views

How many fixed polyominoes does it take to force an aperiodic tiling of the plane?

A longstanding open problem asks whether there is a single connected tile that only tiles the plane aperiodically. As far as I know, this is still open even in the case of polyominoes: we do not know ...
5
votes
0answers
52 views

If a (possibly nonconvex) pentagon tiles the plane, can it do so periodically?

From the classification of monohedral tilings with convex pentagons, we know that all convex pentagons which tile the plane can do so periodically; I'd like to know whether the same result is known to ...
7
votes
2answers
153 views

Smallest non-space-filling polycube?

The title nearly says it all: what is the fewest number of cubes that can be fused face-to-face into a polyhedron that does not fill space? The smallest that seemed like a sure non-tiler to me was 9: ...
3
votes
0answers
64 views

Are there tessellations of the plane with curved $C^1$ shapes?

Does there exist a $C^1$ curve $\alpha:\mathbb{S}^1 \to\mathbb{R}^2$ such that the plane can be tessellated by a union of congruent shapes, each has boundary identical to $\text{Image}(\alpha)$ up to ...
0
votes
0answers
29 views

Create tesselation of a hexagonal lattice (arm chair pattern)

I am creating a graph which consists of edges between nodes. I am given a function which inserts an edge between node1 and node2 insertEdge(node1, node2). The ...
7
votes
0answers
59 views

Octahedron to tetrahedron ratio in generalized polyominoes in the tetrahedral-octahedral honeycomb

Drake Thomas and I have proposed a sequence A343909 to the On-Line Encyclopedia of Integer Sequences (OEIS), which counts "generalized polyforms": generalizations of free polyominoes (Tetris ...
2
votes
1answer
105 views

What is a minimum number of $1\times 3$ tiles that can be put on a table $5\times 5$ so that no more tiles $1\times 3$ can be put on it?

What is a minimum number of $1\times 3$ tiles that can be put on a table $5\times 5$ so that no more tiles $1\times 3$ can be put on it? It is 5 but I can not prove that if we put 4 tiles there is ...
1
vote
0answers
13 views

Proof that higher-order Voronoi diagrams subdivide space

The Wikipedia article on Voronoi diagrams claims that higher-order Voronoi diagrams subdivide space. This is far from obvious. Can anyone point me to a proof?
1
vote
0answers
43 views

Haberdasher problem of Henry Dudeney - is 4-piece hinged dissection of equilateral triangle into square possible?

Is it possible to divide the equilateral triangle into 4 pieces to build a square with those four pieces, provided that one or two pieces are flipped over to the other side? If possible, I wish to ...
0
votes
0answers
15 views

Can any 2D tessellation be uniquely determined by for each n the number of cycles of length n containing any given vertex?

Basically what it says in the title. The title was actually intended to be: "Can any 2D tessellation be uniquely determined by a partition of its vertices into types and for each type a sequence ...
1
vote
0answers
28 views

Edge relation between Archimedean tessellations

I have run a simple script that numerically computes edge lengths of various hyperbolic tessellations and compares them. It seems that if you fit two squares and two 2n-gons to each vertex (...
3
votes
0answers
38 views

Can a monohedral tiling have more than $21$ corner-adjacencies at every tile?

Suppose we tile the plane with a simply-connected tile $T$, and we wish to ensure that every tile touches at least $k$ other tiles. If we restrict "touching" to require sharing a positive-...
1
vote
0answers
27 views

How to find a tessellation from a basis of linear transformations?

Sorry if this is a repeat. It seems like something that should be well known, but I have never found a really good way to write computer code to solve this problem, despite having ad hoc solutions for ...
3
votes
0answers
42 views

If an animal tiles the plane via translation, can it do so in a lattice configuration?

It is known that if a polyomino tiles the plane using only translated copies, then it has at least one such tiling where the centroids of each tile form a lattice; see for instance the paper Arbitrary ...
1
vote
0answers
22 views

Which tessellating 4-polytope has the largest symmetry group?

If we consider the set of all 4-polytopes which can tessellate four-dimensional space, which has the largest symmetry group? The tesseract clearly tessellates four-dimensional space and its symmetry ...
0
votes
1answer
41 views

Tesselation beeing used in a game board

I like to know what is the math behind the outlines of these boards https://www.boardgamegeek.com/image/4383021/spirit-island https://www.boardgamegeek.com/image/4880004/spirit-island https://www....
4
votes
1answer
60 views

Does a tiling being monohedral and monogonal imply that it is isohedral or isogonal?

I’m working through Grünbaum and Shepard’s Tilings & Patterns and I have been unable to make much progress on this problem. Does there exist a tiling that is monohedral and monogonal, but is ...
21
votes
0answers
264 views

Does every 5-celled animal tile the plane?

An animal in the plane is a finite set of grid-aligned unit squares in $\mathbb{R}^2$. (The definition is the same as a polyomino, but where we relax the connectivity requirement.) In this ...
5
votes
0answers
66 views

Tessellation “open” problems for middle/high-schooler

I am a teacher and am currently tutoring middle/high-school students for research initiation, I gave small groups of them topics and let them advance by trials and error with essentially no guidance (...
2
votes
0answers
45 views

Radius of hyperbolic circles in a tessellation

Killing my boredom, I played a bit on Geogebra and started this uniform hyperbolic pattern consisting of 8 circles per vertex. Considering my Poincaré disk model is of Gaussian curvature -1, and using ...
0
votes
0answers
15 views

Number of integer points inside a cover of a set made using disjoints integer rectangles or parallelograms

I Have some problems prooving facts about tessellations in $\mathbb{Z}^d$. I will introduce some notation before stating my problem. Given $A,B\subseteq \mathbb{Z}^d$, with $C(A,B)$ I will denote a ...
2
votes
2answers
100 views

Tilings of the plane and quotient spaces

A square lattice has two discrete translation symmetries, isormorphic to $\mathbb{Z}^2$. If we take the quotient of the plane by this group, $\mathbb{R}^2/\mathbb{Z}^2$, we get the square with ...
3
votes
1answer
95 views

“tessellation” of set of points in 2D with convex polygons

I have a set of points in 2D, that I want to 'triangulate' with the lowest number of convex polygons. Is there an algorithm to do this? (like Delaunay triangulation, but with polygons) Remarks: I ...
0
votes
0answers
45 views

Which pairs of hyperbolic tessellations share edge length?

For any set of regular polygons, it's possible to find edge length that allows to fit these polygons around a vertex in either spherical, Euclidean (for edge $0$), or hyperbolic plane. If we disregard ...
0
votes
0answers
49 views

The icosahedron and fundamental domains of group actions

We can construct an icosahedron from the usual triangular tessellation of the Euclidean plane, by cutting a piece of 20 adjacent triangles and folding it as in the following link: http://geo-dome.co....
3
votes
2answers
82 views

Is there a tessellation with no corners?

Is it possible to have a tessellation of the plane with no corners? Here's what I mean precisely: Is it possible to tile the plane with tiles, each of which is the region enclosed by a smooth simple ...
7
votes
1answer
171 views

Seeking intuition for why tesselations of space by hypercubes in dimensions 8+ need not have a face-to-face pair (Keller's conjecture counterexample)

According to Keller's conjecture: In any tiling of Euclidean space by identical hypercubes there are two cubes that meet face to face. Perhaps surprisingly, this is false for every dimension greater ...
0
votes
0answers
23 views

Determining the number of hexagons needed to cover a region entirely

Given the following conditions, how can one determine the minimum number of hexagons to cover an extent: Extent is given in the format: $(left, down, right, up)$ Hexagons are oriented "flat ...
0
votes
1answer
52 views

Why do circles (of the same sized circumference) not tesselate?

If our test for whether a regular polygon can tesselate with itself is whether the degrees of an individual interior angle can divide 360 to yield an integer (some examples of these integers are 6 [...
1
vote
0answers
69 views

What is the representation of the triangle group for the uniform (4 4 4) tiling of hyperbolic disk in terms of Mobius transformations?

I wonder how can one descibe the generators of the triangle group for the tesselation of Poincare unit disk by triangles with angles $\pi/4, \pi/4 , \pi/4 $ in terms of the action of the modular ...
-2
votes
1answer
64 views

Is there any way to produce a random Voronoi diagram with a specific length and width? [closed]

A Voronoi diagram is an approach to the tessellation of medium. In this diagram, there are many points in a plane that divide the medium to many specific regions by their bisector. Any region is ...
0
votes
0answers
28 views

Distribution of areas of Voronoi cells on a sphere

I have two sets of, respectively, N and M points, which are independently, randomly allocated on a sphere. I consider the Voronoi tessellation of the sphere by the N points, and I want to find how ...
1
vote
1answer
76 views

What regular or semiregular hyperbolic tiling has the smallest average tile area?

I have noticed that hyperbolic tilings tend to be rather "sparse" in that each tile takes up a lot of space. If I remember correctly, for a given curvature the area of any tile in a given hyperbolic ...
0
votes
0answers
20 views

Can the 2D plane be tessellated with a finite set of closed curves that have Geometric continuity > 1?

When I think of tessellating the 2D plane, all examples I can think of (squares, hexagons, rhombuses, polygonal stars...) have at least one point that is G1 continuous, even these fish: Is it ...
0
votes
1answer
34 views

Packing/tessellating 4 dimensional space fully by polytopes? Give examples.

What is a shortlist of first few simplest (say 5~10 simplest) possible shapes of polyhedra/polytopes (with a minimum number of edges shared) to pack the 4-dimensional flat space (say $\mathbb{R}^4$) ...
3
votes
4answers
85 views

Packing/tessellating 3 dimensional space fully by polytopes? Give examples.

What is a shortlist of first few simplest (say 5~10 simplest) possible shapes of polyhedra/polytopes (with a minimum number of edges shared) to pack the 3-dimensional flat space (say $\mathbb{R}^3$) ...
2
votes
1answer
53 views

Properties of Thiessen Polygons

Given a convex polygon, how does one test whether it's part of a Voronoi tesselation? In other words, what is a quick way to test if a polygon is a Thiessen polygon? I suspect one test could involve ...
2
votes
1answer
55 views

Triangle interpolation with 6 control points?

Through a costly simulation, I am able to calculate the value of a function at several discrete points on a plane. My task now is to interpolate, to find the values at all points of the grid. (It is a ...
0
votes
1answer
103 views

How heptagon tesselation layout is computed in hyperboloid model?

I want to try using heptagon-hexagon tesselation grid in hyperbolic plane like the one used in HyperRogue. This is how I understand it: First, graph representing tesselation is generated. (done) ...
0
votes
0answers
32 views

Is it possible to tile two planes, which have some line segments identified, in ways which can't be replicated on just one?

Suppose you have two Euclidean planes, and there is some set of pairs of points (themselves pairs of coordinates) such that for each such pair ((ax,ay),(bx,by)), the line segment connecting the point (...
0
votes
0answers
59 views

Formula for number of squares fitting into a right angle triangle

Is there a known formula for the number of squares of a certain size that would fit into a right angled triangle?
1
vote
1answer
46 views

Finding points for Conway Tessellation

First time on Math SE, so any feedback appreciated I'm working on some generative art that will draw Pinwheel tiles with svgs. To that end I'm building a function that given a set of three points, ...
3
votes
2answers
62 views

Seeking name of $90-135-90-45$ deg angled kite which forms a non-periodic Fractal Tessellation

In Barnsley and Vince's paper Self-Similar Polygonal Tiling https://people.clas.ufl.edu/avince/files/SSPfinal.pdf fig $6$ shows a non-periodic tiling made from a kite in 6 sizes. The angles of the ...
2
votes
2answers
54 views

Substitution scheme in Ammann–Beenker tiling

On wiki page about Ammann–Beenker tiling is described the substitution scheme $R → R r R ; r → R$ that introduces the ratio as a scaling factor: its matrix is the Pell substitution matrix, and the ...
2
votes
1answer
162 views

Higher dimensional plane tessellation

Let $n$ be some finite positive integer value. Now consider the plane $z=n-x-y$, so the points $(n, 0, 0), (0, n, 0), (0, 0, n)$ bound the region of the plane with strictly non-negative coordinates. ...
-1
votes
1answer
13 views

Is there an algorithm to design 3 and n dimensional honeycombs or tessellations?

I have looked into creating multiple dimensional honeycombs, and I can't find an algorithm or methodology for 3 or more dimensions. Is there a general algorithm or heuristic that can be used?
6
votes
2answers
166 views

How to call complementary sides in tiling shapes

How mathematically can we describe the relation between two shapes which fit to each other? Is there a word in geometry for expressing that two sides of a tiling are complementary? How to describe two ...
1
vote
0answers
30 views

“Gaps in the Mats” problem

Problem Background* The mat at your karate dojo composed of 160 square interlocking foam tiles. Along each edge of each tile, there are has five "teeth" (10cm long) and five spaces-for-teeth (again ...