Enumeration of corner polyhedra and 3-connected Schnyder labelings
From MaRDI portal
Publication:6046226
DOI10.37236/11174zbMath1517.51011arXiv2202.09172MaRDI QIDQ6046226
Erkan Narmanli, Gilles Schaeffer, Éric Fusy
Publication date: 16 May 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.09172
Exact enumeration problems, generating functions (05A15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyhedra and polytopes; regular figures, division of spaces (51M20) Asymptotic enumeration (05A16)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Non-D-finite excursions in the quarter plane
- Triangle contact representations and duality
- Schnyder woods and orthogonal surfaces
- Intervals in Catalan lattices and realizers of triangulations
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- Bijective counting of plane bipolar orientations and Schnyder woods
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Geodesic embeddings and planar graphs
- Bipolar orientations revisited
- Walks obeying two-step rules on the square lattice: full, half and quarter planes
- Plattenbauten: touching rectangles in space
- 3-colorable planar graphs have an intersection segment representation using 3 slopes
- Inhomogeneous restricted lattice walks
- Random walks in cones
- Bipolar orientations on planar maps and \(\mathrm{SLE}_{12}\)
- Steinitz Theorems for Orthogonal Polyhedra
- Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
- The enumeration of c-nets via quadrangulations
- Dichromatic polynomials and Potts models summed over rooted maps
- Convex drawings of planar graphs and the order dimension of 3-polytopes
This page was built for publication: Enumeration of corner polyhedra and 3-connected Schnyder labelings
