Drawing plane triangulations with few segments

DOI10.1016/J.COMGEO.2018.02.003MaRDI QIDQ1622344zbMATH OpenOpenAlexFDO

Authors Stephane Durocher, Debajyoti Mondal

Publication date 19 November 2018

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2018.02.003

zbMATH Keywords

grid drawingplane graphslope numberstraight-line drawing

Mathematics Subject Classification ID

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

Recommendations

• Drawings of planar graphs with few slopes and segments
• Minimum-segment convex drawings of 3-connected cubic plane graphs (extended abstract)
• Graph Drawing
• 4-connected triangulations on few lines
• Drawing planar graphs using the canonical ordering

Cites work

• A note on minimum-segment drawings of planar graphs
• Canonical ordering trees and their applications in graph drawing
• Drawing Graphs with Few Arcs
• Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments
• Drawing planar graphs with few geometric primitives
• Drawing trees with perfect angular resolution and polynomial area
• Drawings of planar graphs with few slopes and segments
• How to draw a planar graph on a grid
• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 1953080 (Why is no real title available?)
• Intersection graphs of segments
• Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
• Minimum-segment convex drawings of 3-connected cubic plane graphs
• On topological aspects of orientations
• Pinning balloons with perfect angles and optimal area
• Relating graph thickness to planar layers and bend complexity
• The complexity of drawing graphs on few lines and few planes
• Trade-Offs in Planar Polyline Drawings

Cited in

(9)

• Intersections and circuits in sets of line segments
• 4-connected triangulations on few lines
• Drawing planar graphs with few segments on a polynomial grid
• Drawing Graphs on Few Lines and Few Planes
• Drawing planar cubic 3-connected graphs with few segments: algorithms \& experiments
• 4-connected triangulations on few lines
• The segment number: algorithms and universal lower bounds for some classes of planar graphs
• An annotated review on graph drawing and its applications
• The parametrized complexity of the segment number

This page was built for publication: Drawing plane triangulations with few segments

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