Related papers: Quadrilateral reptiles

A bipartite graph $G=(A, B, E)$ is said to be a biconvex bipartite graph if there exist orderings $<_A$ in $A$ and $<_B$ in $B$ such that the neighbors of every vertex in $A$ are consecutive with respect to $<_B$ and the neighbors of every…

For a finite set $U$ of directions in the Euclidean plane, a convex non-degenerate polygon $P$ is called a $U$-polygon if every line parallel to a direction of $U$ that meets a vertex of $P$ also meets another vertex of $P$. We characterize…

This paper proves the following statement: If a convex body can form a fivefold translative tiling in $\mathbb{E}^3$, it must be a parallelotope, a hexagonal prism, a rhombic dodecahedron, an elongated dodecahedron, a truncated octahedron,…

An $n$-dimensional rep-tile is a compact, connected submanifold of $\mathbb{R}^n$ with non-empty interior which can be decomposed into pairwise isometric rescaled copies of itself whose interiors are disjoint. We show that every smooth…

We prove that a surface in real 3-space containing a line and a circle through each point is a quadric. We also give some particular results on the classification of surfaces containing several circles through each point.

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

A flipturn is an operation that transforms a nonconvex simple polygon into another simple polygon, by rotating a concavity 180 degrees around the midpoint of its bounding convex hull edge. Joss and Shannon proved in 1973 that a sequence of…

This paper proves the following statement: {\it If a convex body can form a twofold translative tiling in $\mathbb{E}^3$, it must be a parallelohedron.} In other words, it must be a parallelotope, a hexagonal prism, a rhombic dodecahedron,…

An unfolding of a polyhedron along its edges is called a vertex unfolding if adjacent faces are allowed to be connected at not only an edge but also a vertex. Demaine et al showed that every triangulated polyhedron has a vertex unfolding.…

For given finite system of convex polygons in the plane which have no transversal, find such homothety transformations of polygons (having fixed centres inside given polygons) with minimal similarity ratio c>1 that the transformed system…

If we label the vertices of a triangle with 1, 2 and 4, and the orthocentre with 7, then any of the four numbers 1, 2, 4, 7 is the nim-sum of the other three and is their orthocentre. Regard the triangle as an orthocentric quadrangle.…

There exists a surface of a convex polyhedron P and a partition L of P into geodesic convex polygons such that there are no connected "edge" unfoldings of P without self-intersections (whose spanning tree is a subset of the edge skeleton of…

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

The diagonals of a quadrilateral form four associated triangles, called half triangles. Each half triangle is bounded by two sides of the quadrilateral and one diagonal. If we locate a triangle center (such as the incenter, centroid,…

In Euclidean geometry, a bicentric quadrilateral is a convex quadrilateral that has both a circumcircle passing through the four vertices and an incircle having the four sides as tangents. Consider a bicentric quadrilateral with rational…

We consider quadrangles of perimeter $2$ in the plane with marked directed edge. To such quadrangle $Q$ a two-dimensional plane $\Pi\in\mathbb{R}^4$ with orthonormal base is corresponded. Orthogonal plane $\Pi^\bot$ defines a plane…

We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…

A convex quadrilateral with sides a,b,c,d, and diagonals p,q is cyclic iff abp-bcq+cdp-daq=0. This condition, in spite of its simplicity, appears to be unnoted and unexpectedly proof-resilient. We employ advanced methods of computer algebra…

A lattice equable quadrilateral is a quadrilateral in the plane whose vertices lie on the integer lattice and which is equable in the sense that its area equals its perimeter. This paper treats the tangential and extangential cases. We show…

The image and the inverse image of a polyhedron under a linear transformation are polyhedrons.