A vertex-face assignment for plane graphs

DOI10.1016/j.comgeo.2008.06.005zbMath1169.05357OpenAlexW1983682886MaRDI QIDQ1025293

Csaba D. Tóth, Diane L. Souvaine

Publication date: 18 June 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.06.005

zbMATH Keywords

pseudo-triangulationencompassing graphplane straight line graph

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Augmenting the edge connectivity of planar straight line graphs to three ⋮ Pointed binary encompassing trees: simple and optimal ⋮ Vertex-colored encompassing graphs

Cites Work

• Combinatorial pseudo-triangulations
• Ray shooting in polygons using geodesic triangulations
• Planar minimally rigid graphs and pseudo-triangulations
• Tight degree bounds for pseudo-triangulations of points
• Algorithm Theory - SWAT 2004
• Pointed and colored binary encompassing trees
• Acute triangulations of polygons
• Every set of disjoint line segments admits a binary tree

This page was built for publication: A vertex-face assignment for plane graphs