Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Theoretical Computer Science
A combinatorial approach to cartograms
Computational Geometry: Theory and Applications
ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
CartoDraw: A Fast Algorithm for Generating Contiguous Cartograms
IEEE Transactions on Visualization and Computer Graphics
Compact floor-planning via orderly spanning trees
Journal of Algorithms
RecMap: Rectangular Map Approximations
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
On rectilinear duals for vertex-weighted plane graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Octagonal drawings of plane graphs with prescribed face areas
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
IEEE Transactions on Visualization and Computer Graphics
Octagonal drawings of plane graphs with prescribed face areas
Computational Geometry: Theory and Applications
Rectangular cartograms: the game
Proceedings of the twenty-fifth annual symposium on Computational geometry
Orientation-Constrained Rectangular Layouts
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Optimizing regular edge labelings
GD'10 Proceedings of the 18th international conference on Graph drawing
Orthogonal cartograms with few corners per face
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Adjacency-preserving spatial treemaps
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A splitting line model for directional relations
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
On rectilinear duals for vertex-weighted plane graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Proportional contact representations of planar graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
How to visualize the k-root name server (demo)
GD'11 Proceedings of the 19th international conference on Graph Drawing
Linear-time algorithms for hole-free rectilinear proportional contact graph representations
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Proportions in categorical and geographic data: visualizing the results of political elections
Proceedings of the International Working Conference on Advanced Visual Interfaces
Computing cartograms with optimal complexity
Proceedings of the twenty-eighth annual symposium on Computational geometry
Optimal binary representation of mosaic floorplans and baxter permutations
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Drawing planar 3-trees with given face areas
Computational Geometry: Theory and Applications
Edge-Weighted contact representations of planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Time-Space maps from triangulations
GD'12 Proceedings of the 20th international conference on Graph Drawing
Neighborhood relation diagrams for local comparison of carbon footprints in urban planning
Information Visualization
Orthogonal cartograms with at most 12 corners per face
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
A rectangular cartogram is a type of map where every region is a rectangle. The size of the rectangles is chosen such that their areas represent a geographic variable (e.g., population). Good rectangular cartograms are hard to generate: The area specifications for each rectangle may make it impossible to realize correct adjacencies between the regions and so hamper the intuitive understanding of the map. We present the first algorithms for rectangular cartogram construction. Our algorithms depend on a precise formalization of region adjacencies and build upon existing VLSI layout algorithms. Furthermore, we characterize a non-trivial class of rectangular subdivisions for which exact cartograms can be computed efficiently. An implementation of our algorithms and various tests show that in practice, visually pleasing rectangular cartograms with small cartographic error can be generated effectively.