相关论文: Computational Geometry Column 39
We introduce the problem of partitioning 2D regions (usually convex regions) into mutually congruent pieces ('tiles').
We show that the following problem is undecidable: given two polygonal prototiles, determine whether the plane can be tiled with rotated and translated copies of them. This improves a result of Demaine and Langerman [SoCG 2025], who showed…
We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are…
We consider the problem of finding a net that supports prescribed forces applied at prescribed points, yet avoids certain obstacles, with all the elements of the net under compression (strut net) or under tension (cable web). In the case of…
We define a plane curve to be threadable if it can rigidly pass through a point-hole in a line L without otherwise touching L. Threadable curves are in a sense generalizations of monotone curves. We have two main results. The first is a…
The problem of constructing maximal equiangular tight frames or SICs was raised by Zauner in 1998. Four years ago it was realized that the problem is closely connected to a major open problem in number theory. We discuss why such a…
We show that given $m$ proteins (or protein backbones, which are modeled as 3D polygonal chains each of length O(n)) the problem of protein local structure alignment under the discrete Fr\'{e}chet distance is as hard as Independent Set. So…
In this work, we answer an open problem in the study of phylogenetic networks. Phylogenetic trees are rooted binary trees in which all edges are directed away from the root, whereas phylogenetic networks are rooted acyclic digraphs. For the…
We introduce bindings that enable the convenient, efficient, and reliable use of software modules of CGAL (Computational Geometry Algorithm Library), which are written in C++, from within code written in Python. There are different tools…
We prove that it is NP-hard to decide whether a graph is the square of a 6-apex graph. This shows that the square root problem is not tractable for squares of sparse graphs (or even graphs from proper minor-closed classes).
Given $n$ pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any $\varepsilon>0$, the triangles can be cut into $O(n^{3/2+\varepsilon})$ connected semi-algebraic pieces, whose…
Ray intersection graphs are intersection graphs of rays, or halflines, in the plane. We show that any planar graph has an even subdivision whose complement is a ray intersection graph. The construction can be done in polynomial time and…
The graph crossing number problem, cr(G)<=k, asks for a drawing of a graph G in the plane with at most k edge crossings. Although this problem is in general notoriously difficult, it is fixed- parameter tractable for the parameter k…
The subquadratic algorithm of Kapoor for finding shortest paths on a polyhedron is described.
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…
We study three covering problems in the plane. Our original motivation for these problems come from trajectory analysis. The first is to decide whether a given set of line segments can be covered by up to four unit-sized, axis-parallel…
The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…
Presented is a new method yielding parameterized solution to an interval parametric linear system. Some properties of this method are discussed. The solution enclosure it provides is compared to the enclosures by other methods. It is shown…
A general half-plane contact problem in which the geometry is specified in a piecewise-quadratic sense over three segments is solved in closed form. This includes the effects of a moment applied sufficient to introduce separation of one…
In the packing-constrained point covering problem, PC^2, one seeks configurations of points in the plane that cannot all be covered by a packing arrangement of unit disks. We consider in particular the problem of finding the minimum number…