Related papers: Edge Tessellation and Stamp Foldings Puzzles
In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…
A self-avoiding plane-filling curve cannot be periodic, but we show that it can satisfy the local isomorphism property. We investigate three families of coverings of the plane by finite sets of nonoverlapping self-avoiding curves which…
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a…
We give a simple proof of T. Stehling's result, that in any normal tiling of the plane with convex polygons with number of sides not less than six, all tiles except the finite number are hexagons.
A \emph{thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once, either at a common end vertex or in a proper crossing. Conway's thrackle conjecture states that the number of edges is at most the number of…
There is a widespread method to represent the envelope when a given hyperplane family creates an envelope. However, one sometimes encounters cases when the widespread method fails to represent the desired envelope precisely, and is…
Entropic self-assembly is governed by the shape of the constituent particles, yet a priori prediction of crystal structures from particle shape alone is non-trivial for anything but the simplest of space-filling shapes. At the same time,…
If a collection of identical particles is poured into a container, different shapes will fill to different densities. But what is the shape that fills a container as close as possible to a pre-specified, desired density? We demonstrate a…
We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…
Toeplitz's Square Peg Problem asks whether every continuous simple closed curve in the plane contains the four vertices of a square. It has been proved for various classes of sufficiently smooth curves, some of which are dense, none of…
Clustering a signed graph means partitioning the vertices into sets ("clusters") so that every positive edge, and no negative edge, is within a cluster. Clustering is not always possible; the obstruction is circles with exactly one negative…
Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…
We consider the combinatorial question of how many convex polygons can be made by using the edges taken from a fixed triangulation of n vertices. For general triangulations, there can be exponentially many: we show a construction that has…
A (complete) matching of the cells of a triangulated manifold can be thought as a combinatorial or discrete version of a nonsingular vector field. We give several methods for constructing such matchings.
We present an exact formula for the number of distinct crease patterns in a square shaped region of a given size that appear in the 2 dimensional paperfolding structure.
Spiral Galaxies is a pencil-and-paper puzzle played on a grid of unit squares: given a set of points called centers, the goal is to partition the grid into polyominoes such that each polyomino contains exactly one center and is 180{\deg}…
This communication describes a representation of images as a set of edges characterized by their position and orientation. This representation allows the comparison of two images and the computation of their similarity. The first step in…
This article is a gentle introduction to the mathematical area known as circle packing, the study of the kinds of patterns that can be formed by configurations of non-overlapping circles. The first half of the article is an exposition of…
In this paper, on envelopes created by circle families in the plane, all four basic problems (existence problem, representation problem, problem on the number of envelopes, problem on relationships of definitions) are solved.
We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.