Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
From MaRDI portal
Publication:4962712
DOI10.1145/1361192.1361196zbMath1451.05230arXiv0810.2608MaRDI QIDQ4962712
Gilles Schaeffer, Dominique Poulalhon, Éric Fusy
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0810.2608
05C10: Planar graphs; geometric and topological aspects of graph theory
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Fast and compact planar embeddings, Unified bijections for maps with prescribed degrees and girth, A bijection for triangulations, quadrangulations, pentagulations, etc., Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth, Schnyder woods for higher genus triangulated surfaces, with applications to encoding, New bijective links on planar maps via orientations, Counting colored planar maps: algebraicity results, Uniform random sampling of planar graphs in linear time