Drawing slicing graphs with face areas

DOI10.1016/J.TCS.2008.10.038zbMATH Open1162.68026OpenAlexW2009461451MaRDI QIDQ1007248FDOQ1007248

Hiroshi Nagamochi, Akifumi Kawaguchi

Publication date: 20 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.038

zbMATH Keywords

graph algorithmsgraph drawingplane graphsorthogonal drawingslicing graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph drawing software
• Drawing graphs. Methods and models
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• Bemerkungen zum Vierfarbenproblem
• Convex Maps
• Graph Drawing
• Convex Representations of Graphs
• Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
• On the optimal binary plane partition for sets of isothetic rectangles
• Graph-Theoretic Concepts in Computer Science
• Sliceable Floorplanning by Graph Dualization

Cited In (4)

• An annotated review on graph drawing and its applications
• Rectilinear Duals Using Monotone Staircase Polygons
• Constrained floorplans in 2D and 3D
• Drawing planar graphs with prescribed face areas

This page was built for publication: Drawing slicing graphs with face areas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007248)