相关论文: Flip Distance Between Two Triangulations of a Poin…

Continuing results from JCDCGGG 2016 and 2017, we solve several new cases of the simple foldability problem -- deciding which crease patterns can be folded flat by a sequence of (some model of) simple folds. We give new efficient algorithms…

In the convex set of all $3\ot 3$ states with positive partial transposes, we show that one can take two extreme points whose convex combinations belong to the interior of the convex set. Their convex combinations may be even in the…

For the given regular plane polygon and an arbitrary point in the plane of the polygon, the distances from the point to the vertices of the polygon are defined. We proved that there is one more non-congruent regular polygon having the…

We associate strand diagrams to tilings of surfaces with marked points, generalising Scott's method for triangulations of polygons. We thus obtain a map from tilings of surfaces to permutations of the marked points on boundary components,…

The number of triangulations of a planar n point set is known to be $c^n$, where the base $c$ lies between $2.43$ and $30.$ The fastest known algorithm for counting triangulations of a planar n point set runs in $O^*(2^n)$ time. The fastest…

Suppose we are given a finite set of points $P$ in $\R^3$ and a collection of polytopes $\mathcal{T}$ that are all translates of the same polytope $T$. We consider two problems in this paper. The first is the set cover problem where we want…

For a given pair of numbers $(d,k)$, we establish the minimal number of vertices in pure $d$-dimensional simplicial complexes with non-trivial homology in dimension $k$. Furthermore, we solve the problem under the additional constraint of…

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…

We introduce an elementary transformation called flips on tilings by squares and triangles and conjecture that it connects any two tilings of the same region of the Euclidean plane.

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…

We give an overview of the 2023 Computational Geometry Challenge targeting the problem Minimum Coverage by Convex Polygons, which consists of covering a given polygonal region (possibly with holes) by a minimum number of convex subsets, a…

The calculation of Euclidean distance between points is generalized to one-dimensional objects such as strings or polymers. Necessary and sufficient conditions for the minimal transformation between two polymer configurations are derived.…

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

In this paper, we consider the problem of determining in polynomial time whether a given planar point set $P$ of $n$ points admits 4-connected triangulation. We propose a necessary and sufficient condition for recognizing $P$, and present…

We determine the minimum number of vertices needed to provide balanced triangulations of $\mathbb S^{d-2}$-bundles over $\mathbb S^1$. If $d$ is odd and the bundle is orientable, or $d$ is even and the bundle is non-orientable, the minimum…

Given two distinct point sets $P$ and $Q$ in the plane, we say that $Q$ \emph{blocks} $P$ if no two points of $P$ are adjacent in any Delaunay triangulation of $P\cup Q$. Aichholzer et al. (2013) showed that any set $P$ of $n$ points in…

Two decision problems related to the computation of stopping sets in Tanner graphs are shown to be NP-complete. NP-hardness of the problem of computing the stopping distance of a Tanner graph follows as a consequence

Let $P$ be a polygonal curve in $\mathbb{R}^D$ of length $n$, and $S$ be a point set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that its Fr\'echet distance from $P$ is less than a…

Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits…

The polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for…