Orthogonal cartograms with at most 12 corners per face
From MaRDI portal
Publication:390136
DOI10.1016/j.comgeo.2013.08.005zbMath1280.05091OpenAlexW2088133390MaRDI QIDQ390136
Lesvia Elena Ruiz Velázquez, Therese C. 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
Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations
- How to draw a planar graph on a grid
- On rectangular cartograms
- Octagonal drawings of plane graphs with prescribed face areas
- On rectilinear duals for vertex-weighted plane graphs
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Drawing planar graphs using the canonical ordering
- Drawings of planar graphs with few slopes and segments
- Bemerkungen zum Vierfarbenproblem
- Area-Universal and Constrained Rectangular Layouts
- Straight line embeddings of cubic planar graphs with integer edge lengths
- OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS
- Plane Cubic Graphs with Prescribed Face Areas
- Orthogonal Cartograms with Few Corners Per Face
- Orthogonal Drawings for Plane Graphs with Specified Face Areas
- Convex Maps
- On Diagrams Representing Maps
- Computing cartograms with optimal complexity
- Graph Drawing
