3 search results - page 1 / 1 » On Rectangular Cartograms |
CORR
2012
Springer
12 years 1 months 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 ...
ESA
2004
Springer
13 years 10 months ago
2004
Springer
CHI
2010
ACM
14 years 5 days ago
2010
ACM
Understanding perception is critical to effective visualization design. With its low cost and scalability, crowdsourcing presents an attractive option for evaluating the large des...