How to Draw a Planarization

DOI10.1007/978-3-319-51963-0_23zbMath1445.68150OpenAlexW2569314284MaRDI QIDQ2971142

Thomas Bläsius, Marcel Radermacher, Ignaz Rutter

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_23

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

An annotated review on graph drawing and its applications ⋮ How to Draw a Planarization ⋮ Polyline drawings with topological constraints

Uses Software

• Moca

Cites Work

• Unnamed Item
• Unnamed Item
• Corrections to Lee's visibility polygon algorithm
• Inserting an edge into a planar graph
• Drawing planar graphs using the canonical ordering
• Fáry’s Theorem for 1-Planar Graphs
• Drawing Simultaneously Embedded Graphs with Few Bends
• Topology-Driven Force-Directed Algorithms
• The maximum number of halving lines and the rectilinear crossing number of for
• Complexity of Some Geometric and Topological Problems
• Topology Preserving Constrained Graph Layout
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Plane-sweep algorithms for intersecting geometric figures
• A FAST STRAIGHT-SKELETON ALGORITHM BASED ON GENERALIZED MOTORCYCLE GRAPHS
• Motorcycle graphs
• How to Draw a Graph
• Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area

This page was built for publication: How to Draw a Planarization