OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS
From MaRDI portal
Publication:3562854
DOI10.1142/S0218195910003268zbMath1187.62004OpenAlexW2899517269WikidataQ59782317 ScholiaQ59782317MaRDI QIDQ3562854
Bettina Speckmann, Elena Mumford, Mark T. de Berg
Publication date: 28 May 2010
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195910003268
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE ⋮ Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach ⋮ Orthogonal cartograms with at most 12 corners per face ⋮ On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ Computing cartograms with optimal complexity ⋮ Octagonal drawings of plane graphs with prescribed face areas ⋮ On rectilinear duals for vertex-weighted plane graphs
Cites Work
- Unnamed Item
- On rectangular cartograms
- On rectilinear duals for vertex-weighted plane graphs
- On the optimal binary plane partition for sets of isothetic rectangles
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- A combinatorial approach to cartograms.
- Diffusion-based method for producing density-equalizing maps
This page was built for publication: OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS
