Related papers: Pentagon contact representations
We define some Schnyder-type combinatorial structures on a class of planar triangulations of the pentagon which are closely related to 5-connected triangulations. The combinatorial structures have three incarnations defined in terms of…
A square-contact representation of a planar graph $G=(V,E)$ maps vertices in $V$ to interior-disjoint axis-aligned squares in the plane and edges in $E$ to adjacencies between the sides of the corresponding squares. In this paper, we study…
Triangulations of the 5-gon with no separating triangle nor quadrangle, so called 5c-triangulations, are a planar map family closely related to 5-connected planar triangulations. We show that 5c-triangulations are in bijection with…
We consider {\em L-graphs}, that is contact graphs of axis-aligned L-shapes in the plane, all with the same rotation. We provide several characterizations of L-graphs, drawing connections to Schnyder realizers and canonical orders of…
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
We consider the problem of morphing between contact representations of a plane graph. In an $\mathcal F$-contact representation of a plane graph $G$, vertices are realized by internally disjoint elements from a family $\mathcal F$ of…
For a graph $G$, let $\mathscr{C}_5(G)$ denote the graph whose vertices are the induced $5$-cycles of $G$, where two vertices are adjacent whenever the corresponding cycles share an edge. We investigate the iterative behavior of the…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar bar-and-joint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer…
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalization of Schnyder woods to $d$-angulations (plane graphs with…
We investigate two optimization problems on area-proportional rectangle contact representations for layered, embedded planar graphs. The vertices are represented as interior-disjoint unit-height rectangles of prescribed widths, grouped in…
Planar bipartite graphs can be represented as touching graphs of horizontal and vertical segments in $\mathbb{R}^2$. We study a generalization in space: touching graphs of axis-aligned rectangles in $\mathbb{R}^3$, and prove that planar…
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…
In spacetime dimensions of 4 (i.e., 3+1) and higher, topological orders exhibit spatially extended excitations like loops and membranes, which support diverse topological data characterizing braiding, fusion, and shrinking processes,…
We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees, with interesting consequences for enumeration, mesh compression and graph sampling. Our bijection yields an efficient uniform random…
3-manifolds are commonly represented as triangulations, consisting of abstract tetrahedra whose triangular faces are identified in pairs. The combinatorial sparsity of a triangulation, as measured by the treewidth of its dual graph, plays a…
In this work we consider balanced Schnyder woods for planar graphs, which are Schnyder woods where the number of incoming edges of each color at each vertex is balanced as much as possible. We provide a simple linear-time heuristic leading…
We prove that every planar graph is the intersection graph of homothetic triangles in the plane.
We define a far-reaching generalization of Schnyder woods which encompasses many classical combinatorial structures on planar graphs. Schnyder woods are defined for planar triangulations as certain triples of spanning trees covering the…
Polygon representation learning is essential for diverse applications, encompassing tasks such as shape coding, building pattern classification, and geographic question answering. While recent years have seen considerable advancements in…