Related papers: Combinatorial pseudo-Triangulations
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.
We review some recent results in the generic rigidity theory of planar frameworks with forced symmetry, giving a uniform treatment to the topic. We also give new combinatorial characterizations of minimally rigid periodic frameworks with…
Any simple planar graph can be triangulated, i.e., we can add edges to it, without adding multi-edges, such that the result is planar and all faces are triangles. In this paper, we study the problem of triangulating a planar graph without…
In this note we give a short and elementary proof of a more general version of Whitney's theorem that 3-connected planar graphs have a unique embedding in the plane. A consequence of the theorem is that cubic plane graphs cannot be embedded…
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…
The Circle Pattern Theorem characterizes the existence and rigidity of circle patterns with prescribed intersection angles on simplicial triangulations of closed surfaces. In this paper we extend the theorem to quasi-simplicial…
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which the edges of the graph are not allowed to cross. Given an arbitrary convex shape $C$, a constrained Delaunay graph is constructed by adding…
A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. Only…
We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…
This paper addresses the problem of constructing bearing rigid networks in arbitrary dimensions. We first show that the bearing rigidity of a network is a generic property that is critically determined by the underlying graph of the…
A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph…
We characterise the quotient surface graphs arising from symmetric contact systems of line segments in the plane and also from symmetric pointed pseudotriangulations in the case where the group of symmetries is generated by a translation or…
We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case…
The C-Planarity problem asks for a drawing of a $\textit{clustered graph}$, i.e., a graph whose vertices belong to properly nested clusters, in which each cluster is represented by a simple closed region with no edge-edge crossings, no…
Recent work has shown that if an isostatic bar and joint framework possesses non-trivial symmetries, then it must satisfy some very simply stated restrictions on the number of joints and bars that are `fixed' by various symmetry operations…
A fundamental theorem of Laman characterises when a bar-joint framework realised generically in the Euclidean plane admits a non-trivial continuous deformation of its vertices. This has recently been extended in two ways. Firstly to…
Splitting invariants describe how a plane curve "splits" by the pull-back under a Galois cover over the projective plane whose branch locus contains no component of the plane curve. They enable us to distinguish the embedded topology of…
We characterise rigid graphs for cylindrical normed spaces $Z=X\oplus_\infty \mathbb{R}$ where $X$ is a finite dimensional real normed linear space and $Z$ is endowed with the product norm. In particular, we obtain purely combinatorial…
We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…