Optimal Polygonal Representation of Planar Graphs
- 11 May 2011
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 63 (3) , 672-691
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Optimal Polygonal Representation of Planar GraphsAlgorithmica, 2011
- On rectilinear duals for vertex-weighted plane graphsDiscrete Mathematics, 2009
- Rectangular layouts and contact graphsACM Transactions on Algorithms, 2008
- Squarified Treemaps2000
- Rectangle of Influence Drawings of Graphs without Filled 3-CyclesLecture Notes in Computer Science, 1999
- A linear-time algorithm for drawing a planar graph on a gridInformation Processing Letters, 1995
- Proximity drawability: A survey extended abstractLecture Notes in Computer Science, 1995
- On Triangle Contact GraphsCombinatorics, Probability and Computing, 1994
- How to draw a planar graph on a gridCombinatorica, 1990
- Small sets supporting fary embeddings of planar graphs1988