Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
From MaRDI portal
Publication:2136282
DOI10.1016/j.tcs.2022.03.031OpenAlexW4220663148MaRDI QIDQ2136282
Jonathan Klawitter, Alexander Wolff, Steven Chaplick, Philipp Kindermann, Ignaz Rutter, Stefan Felsner
Publication date: 10 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.031
Related Items (3)
Extending partial representations of circular-arc graphs ⋮ Morphing rectangular duals ⋮ A theory of L-shaped floor-plans
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangle contact representations and duality
- Extending partial representations of proper and unit interval graphs
- The partial visibility representation extension problem
- On rectangular cartograms
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Extending partial representations of trapezoid graphs
- Extending partial representations of interval graphs
- Optimal polygonal representation of planar graphs
- The dissection of rectangles into squares
- Extending partial representations of rectangular duals with given contact orientations
- Rectangle and Square Representations of Planar Graphs
- Area-Universal and Constrained Rectangular Layouts
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
- Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem
- Towards Characterizing Graphs with a Sliceable Rectangular Dual
- Simultaneous Interval Graphs
- Contact Representations of Graphs in 3D
- Rectangular duals of planar graphs
- On Finding the Rectangular Duals of Planar Triangular Graphs
- On Triangle Contact Graphs
- Sliceable Floorplanning by Graph Dualization
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
- Rectangular layouts and contact graphs
- Simultaneous Embedding
- Extending partial representations of circle graphs
- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
This page was built for publication: Simple algorithms for partial and simultaneous rectangular duals with given contact orientations