scientific article; zbMATH DE number 2038776

zbMath1039.05028MaRDI QIDQ4449243

Dominique Poulalhon, Gilles Schaeffer

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27191080.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

planar graphstree decompositionplane triangulationslinear random sampling algorithm

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

A random tunnel number one 3-manifold does not fiber over the circle, Finite covers of random 3-manifolds, On the Number of α-Orientations, Quick encoding of plane graphs in \(\log _{2}14\) bits per edge, Planar graphs, via well-orderly maps and trees, A Compact Encoding of Plane Triangulations with Efficient Query Supports, Intervals in Catalan lattices and realizers of triangulations, Transversal structures on triangulations: A combinatorial study and straight-line drawings