Simple algorithms for partial and simultaneous rectangular duals with given contact orientations

DOI10.1016/J.TCS.2022.03.031OpenAlexW4220663148MaRDI QIDQ2136282FDOQ2136282

Jonathan Klawitter, Alexander Wolff, Steven Chaplick, Philipp Kindermann, Stefan Felsner, Ignaz Rutter

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

zbMATH Keywords

rectangular dualpartial representation extensionsimultaneous representation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• On Finding the Rectangular Duals of Planar Triangular Graphs
• The dissection of rectangles into squares
• Transversal structures on triangulations: A combinatorial study and straight-line drawings
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Rectangle and Square Representations of Planar Graphs
• Simultaneous Interval Graphs
• The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
• Optimal polygonal representation of planar graphs
• Area-universal and constrained rectangular layouts
• On Triangle Contact Graphs
• Rectangular duals of planar graphs
• Rectangular layouts and contact graphs
• On rectangular cartograms
• Triangle contact representations and duality
• Extending partial representations of interval graphs
• Extending partial representations of proper and unit interval graphs
• Contact Representations of Graphs in 3D
• Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
• Extending partial representations of circle graphs
• Extending partial representations of trapezoid graphs
• Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
• The partial visibility representation extension problem
• Sliceable Floorplanning by Graph Dualization
• Extending partial representations of rectangular duals with given contact orientations
• Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem
• Towards Characterizing Graphs with a Sliceable Rectangular Dual
• Simultaneous Embedding

Cited In (3)

• Morphing rectangular duals
• Extending partial representations of circular-arc graphs
• A theory of L-shaped floor-plans

   Recommendations

• Extending partial representations of rectangular duals with given contact orientations 👍 👎
• Title not available (Why is that?) 👍 👎
• A variable dimension fixed point algorithm and the orientation of simplices 👍 👎
• Two algorithms for finding rectangular duals of planar graphs 👍 👎
• Surrogate duality based method for contact problems 👍 👎
• Title not available (Why is that?) 👍 👎
• A contact searching algorithm for general contact problems 👍 👎
• SIMULTANEOUS CONTAINMENT OF SEVERAL POLYGONS: ANALYSIS OF THE CONTACT CONFIGURATIONS 👍 👎
• A dual Lagrange method for contact problems with regularized contact conditions 👍 👎
• An algorithmic approach to simultaneous triangularization 👍 👎

This page was built for publication: Simple algorithms for partial and simultaneous rectangular duals with given contact orientations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136282)