相关论文: Computational Geometry Column 39

A convex geometry is a closure system satisfying the anti-exchange property. In this work we document all convex geometries on 4- and 5-element base sets with respect to their representation by circles on the plane. All 34 non-isomorphic…

A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a convex partition, the union of the internal faces give the…

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…

In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex…

This survey of some of the more topological aspects of the placement problem for complex curves in complex surfaces was originally published in L'Enseignement Mathematique 29 (1983). The present LaTeXed redaction corrects several…

We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…

In this paper we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention…

We show that the open problem presented in "Geometric Folding Algorithms: Linkages, Origami, Polyhedra" [DO07] is solved by a theorem of Burago and Zalgaller [BZ96] from more than a decade earlier.

The Heesch problem 'grades' polygons that fail to tile the plane in terms of the number of layers (or corollas) of copies of it that can be formed around a central unit. We study the different topology of ' walls', which we define to be…

In the paper, we consider the rigidity problem of the infinite hexagonal triangulation of the plane under the piecewise linear conformal changes introduced by Luo in [5]. Our result shows that if a geometric hexagonal triangulation of the…

Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an n-dimensional space equipped with a convex hull operator, by the…

A folded chain, with one end fixed at the ceiling and the other end released from the same elevation, is commonly modeled as an energy-conserving system in one-dimension. However, the analytical paradigms in previous literature is…

The Cramer-Castillon problem (CCP) consists in finding one or more polygons inscribed in a circle such that their sides pass cyclically through a list of $N$ points. We study this problem where the points are the vertices of a triangle and…

We give a few simple methods to geometically describe some polygon and chain-spaces in R^d. They are strong enough to give tables of m-gons and m-chains when m <= 6.

We revisit the classical problem of the behavior of an isolated linear polymer chain in confined spaces, introducing the distinction between two different confinement regimes (the {\it weak} and the {\it strong} confinement regimes,…

This paper investigated the problem of embedding a simple Hamiltonian Cycle with n vertices on n points inside a simple polygon. This problem seeks to embed a straight-line cycle (without bends), which does not intersect either itself or…

We give an overview of the 2024 Computational Geometry Challenge targeting the problem \textsc{Maximum Polygon Packing}: Given a convex region $P$ in the plane, and a collection of simple polygons $Q_1, \ldots, Q_n$, each $Q_i$ with a…

Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…

We analyse the conformational behaviour of a linear semiflexible homo-polymer chain confined by two geometrical constraints under a good solvent condition in two dimensions. The constraints are stair shaped impenetrable surfaces. The…

The "interior goat problem" is a numerical puzzle which has haunted mathematicians for nearly three centuries. Closed-form solutions have only been found for the two-dimensional case, and although approximations have been established for…