On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
From MaRDI portal
Publication:2936956
DOI10.1007/978-3-662-45803-7_40zbMath1405.68252OpenAlexW2108385987MaRDI QIDQ2936956
Martin Nöllenburg, Ignaz Rutter, Roman Prutkin
Publication date: 7 January 2015
Published in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-45803-7_40
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