Showing cs.CGShow all
2 papers · 1 filter
cs.CG2025
Parameterized Approaches to Orthogonal Compaction
Walter Didimo, Siddharth Gupta, Philipp Kindermann +3
Orthogonal graph drawings are used in applications such as UML diagrams, VLSI layout, cable plans, and metro maps. We focus on drawing planar graphs and assume that we are given an…
cs.CG2024
The Parametrized Complexity of the Segment Number
Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli +3
Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph , the segment number of is the minimum number of…