An algorithm for accurate and simple-looking metaphorical maps
From MaRDI portal
Cites work
- Computing cartograms with optimal complexity
- Drawing planar graphs with prescribed face areas
- Handbook of data visualization.
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations
- On rectilinear duals for vertex-weighted plane graphs
- Plane Cubic Graphs with Prescribed Face Areas
This page was built for publication: An algorithm for accurate and simple-looking metaphorical maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7354839)