Visibility drawings of plane 3-trees with minimum area
DOI10.1007/S11786-011-0078-1zbMATH Open1254.68189OpenAlexW2104202737MaRDI QIDQ691641FDOQ691641
Authors: Rahnuma Islam Nishat, Debajyoti Mondal 
Publication date: 3 December 2012
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-011-0078-1
Recommendations
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Drawings of planar graphs with few slopes and segments
- Graph Drawing
- Minimum-area drawings of plane 3-trees
- Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
- Visibility representation of plane graphs via canonical ordering tree
- Width-Optimal Visibility Representations of Plane Graphs
- Canonical representations of partial 2- and 3-trees
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- Nearly Optimal Visibility Representations of Plane Graphs
Cited In (5)
This page was built for publication: Visibility drawings of plane 3-trees with minimum area
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691641)
