Orthogonal cartograms with at most 12 corners per face
From MaRDI portal
Publication:390136
DOI10.1016/J.COMGEO.2013.08.005zbMATH Open1280.05091OpenAlexW2088133390MaRDI QIDQ390136FDOQ390136
Authors: Lesvia Elena Ruiz Velázquez, Therese Biedl 
Publication date: 22 January 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.08.005
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- How to draw a planar graph on a grid
- Title not available (Why is that?)
- Drawing planar graphs using the canonical ordering
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Title not available (Why is that?)
- Area-universal and constrained rectangular layouts
- Computing cartograms with optimal complexity
- Drawings of planar graphs with few slopes and segments
- Octagonal drawings of plane graphs with prescribed face areas
- On rectilinear duals for vertex-weighted plane graphs
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations
- Plane Cubic Graphs with Prescribed Face Areas
- Orthogonal cartograms with few corners per face
- Orthogonal Drawings for Plane Graphs with Specified Face Areas
- Title not available (Why is that?)
- On Diagrams Representing Maps
- On rectangular cartograms
- Bemerkungen zum Vierfarbenproblem
- Straight line embeddings of cubic planar graphs with integer edge lengths
- Optimal BSPs and rectilinear cartograms
- Title not available (Why is that?)
- Convex Maps
- Graph Drawing
Cited In (2)
This page was built for publication: Orthogonal cartograms with at most 12 corners per face
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390136)
