Related papers: Computer geometry: Rep-tiles with a hole
The 15 puzzle is a classic reconfiguration puzzle with fifteen uniquely labeled unit squares within a $4 \times 4$ board in which the goal is to slide the squares (without ever overlapping) into a target configuration. By generalizing the…
This article has been written for an educational magazine whose target audience consists of students and teachers of mathematics in universities, colleges and schools. It concerns a notion of duality between rectangles. A proof is given…
We show how to construct a cubic partial cube from any simplicial arrangement of lines or pseudolines in the projective plane. As a consequence, we find nine new infinite families of cubic partial cubes as well as many sporadic examples.
We ask the question of how small a self-assembling set of tiles can be yet have interesting computational behaviour. We study this question in a model where supporting walls are provided as an input structure for tiles to grow along: we…
There are 42 types of real singular points for irreducible real quintic curves and 49 types of real singular points for reducible real quintic curves. The classification of real singular points for irreducible real quintic curves is…
We give an intrinsic characterization of all subsets of a doubling metric space that can arise as a member of some system of dyadic cubes on the underlying space, as constructed by M. Christ.
The nature of binary black hole coalescence is the final, uncharted frontier of the relativistic Kepler problem. In the United States, binary black hole coalescence has been identified as a computational ``Grand Challenge'' whose solution…
A solution to the problem of topological classification of real cubic fourfolds is presented. It is shown that the real locus of a real non-singular cubic fourfold is obtained from a projective 4-space either by adding several trivial one-…
A compendium of thirty previously published open problems in computational geometry is presented.
We prove that a face of a cube can be optimally partitioned into connected 193 sets on which the cut locus, or ridge tree, is constant up to isomorphism as a labeled graph. These are 60 connected open sets, curves bounding them, and…
Choose a polynomial in three variables with not more than three or four monomials of moderate degree. Take simple coefficients as 1 and -1. Then draw a picture of the solution variety in real three space using a ray-tracing program like…
Given a triangulation of a closed topological cube, we show that (under some technical condition) there is an essentially unique tiling of a rectangular parallelepiped by cubes, indexed by the vertices of the triangulation. Moreover, i -…
Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…
It is a classical result that there are $12$ (irreducible) rational cubic curves through $8$ generic points in $\mathbb{P}_{\mathbb{C}}^2$, but little is known about the non-generic cases. The space of $8$-point configurations is…
When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with one or several…
We construct algebras from rhombohedral tilings of Euclidean space obtained as projections of certain cubical complexes. We show that these `Cubist algebras' satisfy strong homological properties, such as Koszulity and quasi-heredity,…
A perfect cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The existence of such cuboids is neither proved, nor disproved. A rational perfect cuboid is a natural…
Integer cuboids are rectangular Diophantine parallelepipeds It has been discovered that these cuboids come in 3 varieties: Euler or body type, edge type, and face type. In all three cases, one edge or diagonal is irrational, all six others…
A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a rich structure, with links to lattice congruences, flip graphs,…
One of the best things about geometry is that it's cool! Geometry enables us to create incredible designs and astounding patterns. This article shows how to use a simple technique (iteration) to create designs that are both cool and…