Computing orthogonal drawings with the minimum number of bends

DOI10.1109/12.868028MaRDI QIDQ4571369zbMATH OpenOpenAlexFDO

Authors P. Bertolazzi, Giuseppe Di Battista, Walter Didimo

Publication date 9 July 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/fbfb0e1e58148762d8670eb5866c61333ed3dfa7

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(16)

• Topological Morphing of Planar Graphs
• Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
• An annotated review on graph drawing and its applications
• HV-planarity: algorithms and complexity
• \(st\)-orientations with few transitive edges
• $st$-Orientations with Few Transitive Edges
• Ranking and unranking of the planar embeddings of a planar graph
• Square-orthogonal drawing with few bends per edge
• scientific article; zbMATH DE number 1974108 (Why is no real title available?)
• Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario
• An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
• On the Total Number of Bends for Planar Octilinear Drawings
• On embedding a graph in the grid with the maximum number of bends and other bad features
• A topology-shape-metrics framework for ortho-radial graph drawing
• Bend-optimal orthogonal drawings of triconnected plane graphs
• Topological morphing of planar graphs

This page was built for publication: Computing orthogonal drawings with the minimum number of bends

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