Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem

DOI10.1007/978-3-319-27261-0_20zbMath1471.68294arXiv1509.00835OpenAlexW1921141150MaRDI QIDQ2959760

Martin Nöllenburg, Jonathan Klawitter, Torsten Ueckerdt

Publication date: 10 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Simple algorithms for partial and simultaneous rectangular duals with given contact orientations ⋮ Extending partial representations of rectangular duals with given contact orientations ⋮ Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count ⋮ Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs

This page was built for publication: Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem