Orthogonal cartograms with at most 12 corners per face

DOI10.1016/J.COMGEO.2013.08.005MaRDI QIDQ390136zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph drawingcartogramsprescribed face areas

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Orthogonal cartograms with few corners per face
• Orthogonal Drawings for Plane Graphs with Specified Face Areas
• Algorithms for area-efficient orthogonal drawing
• Computing cartograms with optimal complexity
• Computing cartograms with optimal complexity

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 2123122 (Why is no real title available?)
• scientific article; zbMATH DE number 512936 (Why is no real title available?)
• scientific article; zbMATH DE number 4185629 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• Area-universal and constrained rectangular layouts
• Bemerkungen zum Vierfarbenproblem
• Computing cartograms with optimal complexity
• Convex Maps
• Drawing planar graphs using the canonical ordering
• Drawings of planar graphs with few slopes and segments
• Graph Drawing
• How to draw a planar graph on a grid
• Linear-time algorithms for hole-free rectilinear proportional contact graph representations
• Octagonal drawings of plane graphs with prescribed face areas
• On Diagrams Representing Maps
• On rectangular cartograms
• On rectilinear duals for vertex-weighted plane graphs
• Optimal BSPs and rectilinear cartograms
• Orthogonal Drawings for Plane Graphs with Specified Face Areas
• Orthogonal cartograms with few corners per face
• Plane Cubic Graphs with Prescribed Face Areas
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Straight line embeddings of cubic planar graphs with integer edge lengths

Cited in

(2)

• Orthogonal cartograms with few corners per face
• Small-area orthogonal drawings of 3-connected graphs

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)