相关论文: Non-crossing frameworks with non-crossing reciproc…

I present an algorithm that, given a number $n \geq 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation can be used as the basis for a wide range of dynamic…

A new class of random spatial tessellations is introduced -- the so-called column tessellations of three-dimensional space. The construction is based on a stationary planar tessellation. Each cell of the spatial tessellation is a prism…

We consider the Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families $\calR$ where $R_1 \setminus R_2$…

An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we…

We establish a general `gluing theorem', which states roughly that if two nondegenerate constant mean curvature surfaces are juxtaposed, so that their tangent planes are parallel and very close to one another, but oppositely oriented, then…

We consider the subspace of the homology of a covering space spanned by lifts of simple closed curves. Our main result is the existence of unbranched covers of surfaces where this is a proper subspace. More generally, for a fixed finite…

Consider a curve $\Gamma$ in a domain $D$ in the plane $\boldsymbol R^2$. Thinking of $D$ as a piece of paper, one can make a curved folding $P$ in the Euclidean space $\boldsymbol R^3$. The singular set $C$ of $P$ as a space curve is…

Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and studies geometric representations of non-planar graphs in terms of forbidden crossing configurations. Aim of this survey is to describe the main research…

The ideal (tagged resp.) triangulation of bounded surface with marked points are associated with skew-symmetric (skew-symmetrizable) exchange matrices. An algo- rithm is established to decompose the graph associated to such matrix. There…

Spin networks are graphs derived from 3nj symbols of angular momentum. The surface embedding, the topology and dualization of these networks are considered. Embeddings into compact surfaces include the orientable sphere S^2 and the torus T,…

The screened Coulomb interaction between a pair of infinite parallel planes with spatially varying surface charge is considered in the limit of small electrical potentials for arbitrary Debye lengths. A simple expression for the disjoining…

Packings of macroscopic granular chains capture some of the essential aspects of molecular polymer systems and have been suggested as a paradigm to understand the physics on a molecular scale. However, here we demonstrate that the…

The shape of a cell influences and it is influenced by interactions with its neighbouring partners. Here, we introduce a coarse-grained model of non-reciprocal interactions between single-cell organisms to study emergent morphologies during…

The coexistence of sparsity and clustering (non-vanishing average fraction of triangles per node) is one of the few structural features that, irrespective of finer details, are ubiquitously observed across large real-world networks. This…

String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs…

This paper uses the technology of weighted and regular triangulations to study discrete versions of the Laplacian on piecewise Euclidean manifolds. Regular triangulations are studied in some detail, including flip algorithms. The Laplacian…

We present a new framework for multi-view geometry in computer vision. A camera is a mapping between $\mathbb{P}^3$ and a line congruence. This model, which ignores image planes and measurements, is a natural abstraction of traditional…

We consider the problem of reconfiguring non-crossing spanning trees on point sets. For a set $P$ of $n$ points in general position in the plane, the flip graph $F(P)$ has a vertex for each non-crossing spanning tree on $P$ and an edge…

We introduce and study the 1-planar packing problem: Given $k$ graphs with $n$ vertices $G_1, \dots, G_k$, find a 1-planar graph that contains the given graphs as edge-disjoint spanning subgraphs. We mainly focus on the case when each $G_i$…

It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…