2 search results - page 1 / 1 » Homothetic Triangle Contact Representations of Planar Graphs |
CCCG
2007
13 years 6 months ago
2007
In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentra...
CORR
2012
Springer
12 years 10 days ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...