Algorithms and Data Structures
From MaRDI portal
Publication:5900779
DOI10.1007/b11837zbMath1278.68322MaRDI QIDQ5900779
Publication date: 20 April 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (13)
Visibility representations of four-connected plane graphs with near optimal heights ⋮ On simultaneous straight-line grid embedding of a planar graph and its dual ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Strictly-convex drawings of 3-connected planar graphs ⋮ Good spanning trees in graph drawing ⋮ Width-Optimal Visibility Representations of Plane Graphs ⋮ Improved visibility representation of plane graphs ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Planar graphs, via well-orderly maps and trees ⋮ Rectangular-radial drawings of cubic plane graphs ⋮ Spherical-Rectangular Drawings ⋮ Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights ⋮ Visibility representation of plane graphs via canonical ordering tree
This page was built for publication: Algorithms and Data Structures
