相关论文: Connecting Polygonizations via Stretches and Twang…
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 use the recently introduced factorization of motion polynomials for constructing overconstrained spatial linkages with a straight line trajectory. Unlike previous examples, the end-effector motion is not translational and the link graph…
Polygons are cycles embedded into the plane; their vertices are associated with $x$- and $y$-coordinates and the edges are straight lines. Here, we consider a set of polygons with pairwise non-overlapping interior that may touch along their…
We consider the problem of morphing between two planar drawings of the same triangulated graph, maintaining straight-line planarity. A paper in SODA 2013 gave a morph that consists of $O(n^2)$ steps where each step is a linear morph that…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
A sweep of a point configuration is any ordered partition induced by a linear functional. Posets of sweeps of planar point configurations were formalized and abstracted by Goodman and Pollack under the theory of allowable sequences of…
We construct a polygonal spiral by arranging a sequence of regular $n$-gons such that each $n$-gon shares a specified side and vertex with the $(n+1)$-gon in the construction. By offering flexibility for determining the size of each $n$-gon…
Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…
Locomotion of bacteria by actin polymerization, and in vitro motion of spherical beads coated with a protein catalyzing polymerization, are examples of active motility. Starting from a simple model of forces locally normal to the surface of…
A mechanical linkage is a mechanism made of rigid rods linked together by flexible joints, in which some vertices are fixed and others may move. The partial configuration space of a linkage is the set of all the possible positions of a…
Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.
A common choice for the evolution of the knotted graphs in loop quantum gravity is to use the Pachner moves, adapted to graphs from their dual triangulations. Here, we show that the natural way to consistently use these moves is on framed…
Given a set of $n$ point robots inside a simple polygon $P$, the task is to move the robots from their starting positions to their target positions along their shortest paths, while the mutual visibility of these robots is preserved.…
Let $S$ be a planar point set in general position, and let $\mathcal{P}(S)$ be the set of all plane straight-line paths with vertex set $S$. A flip on a path $P \in \mathcal{P}(S)$ is the operation of replacing an edge $e$ of $P$ with…
A geometric $t$-spanner for a set $S$ of $n$ point sites is an edge-weighted graph for which the (weighted) distance between any two sites $p,q \in S$ is at most $t$ times the original distance between $p$ and~$q$. We study geometric…
The statistical mechanics of polymer loops entangled in the two-dimensional array of randomly distributed obstacles of infinite length is discussed. The area of the loop projected to the plane perpendicular to the obstacles is used as a…
A geometric triangulation of a Riemannian manifold is a triangulation where the interior of each simplex is totally geodesic. Bistellar moves are local changes to the triangulation which are higher dimensional versions of the flip operation…
Given a set $A$ of $n$ points (vertices) in general position in the plane, the \emph{complete geometric graph} $K_n[A]$ consists of all $\binom{n}{2}$ segments (edges) between the elements of $A$. It is known that the edge set of every…
Here are versions of the proofs of two classic theorems of combinatorial topology. The first is the result that piecewise linearly homeomorphic simplicial complexes are related by stellar moves. This is used in the proof, modelled on that…
We prove that strictly convex surfaces moving by $K^{\alpha/2}$ become spherical as they contract to points, provided $\alpha$ lies in the range $[1,2]$. In the process we provide a natural candidate for a curvature pinching quantity for…