Extending partial representations of rectangular duals with given contact orientations
From MaRDI portal
Publication:2692733
DOI10.1007/978-3-030-75242-2_24OpenAlexW3161040830MaRDI QIDQ2692733
Ignaz Rutter, Philipp Kindermann, Alexander Wolff, Steven Chaplick, Jonathan Klawitter
Publication date: 22 March 2023
Full work available at URL: https://arxiv.org/abs/2102.02013
Related Items (2)
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations ⋮ Partial and simultaneous transitive orientations via modular decompositions
Cites Work
- Extending partial representations of proper and unit interval graphs
- The partial visibility representation extension problem
- On rectangular cartograms
- 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
- 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
- Rectangular duals of planar graphs
- On Triangle Contact Graphs
- Sliceable Floorplanning by Graph Dualization
- Rectangular layouts and contact graphs
- Extending partial representations of circle graphs
This page was built for publication: Extending partial representations of rectangular duals with given contact orientations