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.

learn more… | top users | synonyms

17
votes
2answers
864 views

doubly periodic functions as tessellations (other than parallelograms)

I think of a snapshot of a single period of a doubly periodic function as one parallelogram-shaped tile in a tessellation, could a function have a period that repeats like honeycomb or some other not ...
3
votes
1answer
259 views

Nets of Geodesic spheres

I would realize the papercraft of a geodesic sphere like this: It is the dual of the one discussed in THIS OTHER QUESTION . Where can I find the printable nets, or the online resources to create ...
13
votes
1answer
1k views

Floret Tessellation of a Sphere

I'm a programmer looking to create a 3D model of a Floret Tessellation of a sphere, like the one in this picture Class III 8,11 floret planar net (source) If anyone could point me in the right ...
5
votes
4answers
708 views

Why a tesselation of the plane by a convex polygon of 7 or more sides is not possible?

I read in several places, including Wikipedia, that a tessellation of the plane by a single, convex, $n-$sided polygon is not possible for $n\geq7$. I was not able to locate a proof, or a paper that ...
3
votes
4answers
3k views

What are the conditions for a polygon to be tessellated?

Upon one of my mathematical journey's (clicking through wikipedia), I encountered one of the most beautiful geometrical concept that I have ever encountered in my 16 and a half years on this oblate ...
3
votes
1answer
68 views

Not understanding this proof in Grünbaum-Shephard's Tilings and Patterns

I'm reading Grünbaum and Shephard's Tilings and Patterns at the moment, and am kind of lost in the brevity of their statement and proof of Statement 10.1.1 (page 524 for anyone who has the book). ...
2
votes
1answer
197 views

How do I calculate the unique k-dimensional hypersphere's center from k+1 points?

I'm working with the Bowyer-Watson algorithm to determine the Delaunay tessellation of stochastic points in k-dimensional space. This algorithm assumes that the center of a simplex can be used as the ...
1
vote
0answers
19 views

Hexagonal tessellation: tesselating a pizza slice shape sector of a circle with a special constraint

Consider a sector(in the shape of a pizza slice) of a disk of radius $R$ such that the sector is enclosed by two raddi and and an arc, where the arc subtends an angle $\frac{2\pi}{n}$. We tessellate ...