On rectangular cartograms
From MaRDI portal
Publication:883236
DOI10.1016/J.COMGEO.2006.06.002zbMATH Open1118.68172DBLPjournals/comgeo/KreveldS07OpenAlexW2148987114WikidataQ59782381 ScholiaQ59782381MaRDI QIDQ883236FDOQ883236
Marc Van Kreveld, Bettina Speckmann
Publication date: 4 June 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.06.002
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Compact floor-planning via orderly spanning trees
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Rectangular duals of planar graphs
- Graph Drawing
- A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
- Diffusion-based method for producing density-equalizing maps
- A combinatorial approach to cartograms.
- Graph-Theoretic Concepts in Computer Science
Cited In (22)
- Octagonal drawings of plane graphs with prescribed face areas
- On rectilinear duals for vertex-weighted plane graphs
- Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
- Algorithms – ESA 2004
- Morphing rectangular duals
- Proportional Contact Representations of Planar Graphs
- Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach
- Extending partial representations of rectangular duals with given contact orientations
- Layered area-proportional rectangle contact representations
- Aspect ratio universal rectangular layouts
- Fixed-energy harmonic functions
- Aspect ratio universal rectangular layouts
- RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY
- OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS
- On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps
- Computing cartograms with optimal complexity
- Orientation-Constrained Rectangular Layouts
- Combinatorial generation via permutation languages. III: Rectangulations
- Table cartogram
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations
- Computing stable Demers cartograms
- Orthogonal cartograms with at most 12 corners per face
Uses Software
Recommendations
This page was built for publication: On rectangular cartograms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883236)
