Show simple item record


dc.creatorKreveld, Marc vanes
dc.creatorSpeckmann, Bettinaes
dc.identifier.citationVan Kreveld, M. y Speckmann, B. (2004). On rectangular cartograms. En 20th European Workshop on Computational Geometry, Sevilla.
dc.description.abstractA 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 (for example population). Rectangular cartograms are a useful tool to visualize statistical data. However, good cartograms are generally 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. Here we present the first fully automated algorithms for rectangular cartograms. Our algorithms depend on a precise formalization of region adjacencies and are building upon existing VLSI layout algorithms. Furthermore, we characterize a non-trivial class of rectangular subdivisions for which exact cartograms can be efficiently computed. An implementation of our algorithms and various tests show that in practice, visually pleasing rectangular cartograms with small cartographic error can be effectively
dc.relation.ispartof20th European Workshop on Computational Geometry (2004).
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.titleOn rectangular cartogramses
dc.eventtitle20th European Workshop on Computational Geometryes

On rectangular cartograms.pdf109.3KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional