On rectangular cartograms Export

@article{citeulike:3788292, abstract = {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.}, author = {van Kreveld, M. and Speckmann, B.}, citeulike-article-id = {3788292}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.comgeo.2006.06.002}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0925772106000770}, doi = {10.1016/j.comgeo.2006.06.002}, issn = {09257721}, journal = {Computational Geometry}, keywords = {algorithm, cartogram, cartography}, month = {August}, number = {3}, pages = {175--187}, posted-at = {2009-09-17 22:13:12}, priority = {2}, title = {On rectangular cartograms}, url = {http://dx.doi.org/10.1016/j.comgeo.2006.06.002}, volume = {37}, year = {2007} }

TY - JOUR ID - citeulike:3788292 L3 - citeulike-article-id:3788292 N2 - 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. IS - 3 JF - Computational Geometry SN - 09257721 EP - 187 TI - On rectangular cartograms VL - 37 SP - 175 KW - algorithm KW - cartogram KW - cartography AU - van Kreveld, M AU - Speckmann, B PY - 2007/08// UR - http://dx.doi.org/10.1016/j.comgeo.2006.06.002 ER -