Morphing Planar Graph Drawings with a Polynomial Number of Steps
DOI10.1137/1.9781611973105.119zbMath1422.68177OpenAlexW4240810405MaRDI QIDQ5741828
Patrizio Angelini, Timothy M. Chan, Bryan T. Wilkinson, Maurizio Patrignani, Vincenzo Roselli, Fabrizio Frati, Giuseppe Di Battista, Anna Lubiw, Sahil Singla, Soroush Alamdari
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: http://epubs.siam.org/doi/abs/10.1137/1.9781611973105.119
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) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (12)
This page was built for publication: Morphing Planar Graph Drawings with a Polynomial Number of Steps