相关论文: Computational Geometry Column 44

This is a study of the construction of particular regular sub-n-gons T in regular n-gons P using a special system of chords of P. In particular, some of these sub-n-gons have areas which are integer divisors of the area of the given n-gon…

Congruent polygons are congruent in angles as well as in edge lengths. We concentrate on the angle aspect, and investigate how tilings of the sphere by congruent pentagons can be determined by the angle information only. We also investigate…

We investigate the existence of closed polylines (also known as closed polygonal chains or self-crossing polygons) that intersect each of their edges the same number of times. The most general question in this corner of combinatorial…

An equilateral triangle cannot be dissected into finitely many mutually incongruent equilateral triangles [Tutte 1948]. Therefore Tuza [Tuza 1991] asked for the largest number $s=s(n)$ such that there is a tiling of an equilateral triangle…

In this Paper, for every $n>5$, we show examples of pairs articulated $n$-gons $P$ and $P'$ of different area such that every ordered sequence of internal angles of $P$ coincide with some ordered sequence of internal angles of $P'$.

We give an overview of the 2020 Computational Geometry Challenge, which targeted the problem of partitioning the convex hull of a given planar point set P into the smallest number of convex faces, such that no point of P is contained in the…

In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex $(2k)$-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of $k$, and…

R. Nandakumar asked whether there is a tiling of the plane by pairwise incongruent triangles of equal area and equal perimeter. Recently a negative answer was given by Kupavskii, Pach and Tardos. Still one may ask for weaker versions of the…

We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…

Recently Gay and Kirby described a new decomposition of smooth closed $4$-manifolds called a trisection. This paper generalises Heegaard splittings of $3$-manifolds and trisections of $4$-manifolds to all dimensions, using triangulations as…

We prove that for any convex polygon $S$ with at least four sides, or a concave one with no parallel sides, and any $m>0$, there is an $m$-fold covering of the plane with homothetic copies of $S$ that cannot be decomposed into two…

Enumeration of tilings is the mathematical study concerning the total number of coverings of regions by similar pieces without gaps or overlaps. Enumeration of tilings has become a vibrant subfield of combinatorics with connections and…

Let $P \subset \mathbb{R}^{d}$ be a closed convex cone. Assume that $P$ is pointed, i.e. the intersection $P \cap -P=\{0\}$ and $P$ is spanning, i.e. $P-P=\mathbb{R}^{d}$. Denote the interior of $P$ by $\Omega$. Let $E$ be a product system…

We determine the possible intersection sizes of a Hermitian surface $\mathcal H$ with an irreducible quadric of ${\mathrm PG}(3,q^2)$ sharing at least a tangent plane at a common non-singular point when $q$ is even.

The Sequential Multiple Knapsack Problem is a special case of Multiple knapsack problem in which the items sizes are divisible. A characterization of the optimal solutions of the problem and a description of the convex hull of all the…

Even though the disk embedding theorem is not available in dimension 4 for free fundamental groups, some surgery problems may be shown to have topological solutions. We prove that surgery problems may be solved if one considers closed…

Let a polygon be composed of equal rectangles. We find all quadratic irrationals r for which the polygon can be tiled by similar rectangles with given side ratio r.

Motivated by questions from Ehrhart theory, we present new results on discrete equidecomposability. Two rational polygons $P$ and $Q$ are said to be discretely equidecomposable if there exists a piecewise affine-unimodular bijection…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the_projections_. We are interested in the problem of reconstructing a tiling…