On the Complexity of HV-rectilinear Planarity Testing
From MaRDI portal
Publication:2936940
DOI10.1007/978-3-662-45803-7_29zbMath1427.68235OpenAlexW121924889MaRDI QIDQ2936940
Maurizio Patrignani, Giuseppe Liotta, Walter Didimo
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: http://link.springer.com/chapter/10.1007%2F978-3-662-45803-7_29
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
Grid recognition: classical and parameterized computational perspectives, Unnamed Item, Planar L-Drawings of Directed Graphs, Bend-minimum orthogonal drawings in quadratic time, On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings