Windrose Planarity: Embedding Graphs with Direction-Constrained Edges

DOI10.1137/1.9781611974331.ch70zbMath1410.68274arXiv1510.02659OpenAlexW4244967770MaRDI QIDQ4575650

Philipp Kindermann, Patrizio Angelini, Valentino Di Donato, Giuseppe Di Battista, Ignaz Rutter, Günter Rote, Giordano Da Lozzo

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.02659

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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)

On the area-universality of triangulations ⋮ Bounded Embeddings of Graphs in the Plane ⋮ A Census of Plane Graphs with Polyline Edges

This page was built for publication: Windrose Planarity: Embedding Graphs with Direction-Constrained Edges