Optimal area algorithm for planar polyline drawings

DOI10.1007/3-540-36379-3_4MaRDI QIDQ4414483zbMATH OpenFDO

Authors Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah

Publication date 25 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2573/25730035.htm

zbMATH Keywords

graph drawing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On Planar Polyline Drawings
• On Area-Optimal Planar Graph Drawings
• Trade-Offs in Planar Polyline Drawings
• Planar polyline drawings via graph transformations
• scientific article; zbMATH DE number 1990911

Cited in

(14)

• Algorithms for area-efficient orthogonal drawing
• Drawing plane triangulations with few segments
• Watermelon uniform random generation with applications
• Planar polyline drawings via graph transformations
• Universal slope sets for 1-bend planar drawings
• Planar graphs, via well-orderly maps and trees
• Trade-Offs in Planar Polyline Drawings
• Large angle crossing drawings of planar graphs in subquadratic area
• On Planar Polyline Drawings
• Drawing Planar Graphs with Reduced Height
• Bounds for the oriented diameter of planar triangulations
• An annotated review on graph drawing and its applications
• Layered polyline drawings of planar graphs
• Orthogonal surfaces and their CP-orders

Describes a project that uses

Uses Software

• Algorithm 447

This page was built for publication: Optimal area algorithm for planar polyline drawings

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