Morphing rectangular duals
From MaRDI portal
Publication:6117082
DOI10.1007/978-3-031-22203-0_28arXiv2112.03040OpenAlexW4319996091MaRDI QIDQ6117082
Ignaz Rutter, Alexander Wolff, Philipp Kindermann, Steven Chaplick, Jonathan Klawitter
Publication date: 16 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.03040
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- 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
- Morphing Schnyder drawings of planar triangulations
- Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
- Optimal morphs of planar orthogonal drawings. II
- Rectangle and Square Representations of Planar Graphs
- How Important Is the “Mental Map”? – An Empirical Investigation of a Dynamic Graph Layout Algorithm
- Rectangular duals of planar graphs
- On Finding the Rectangular Duals of Planar Triangular Graphs
- On Triangle Contact Graphs
- Sliceable Floorplanning by Graph Dualization
- Morphing Contact Representations of Graphs
- Pole Dancing: 3D Morphs for Tree Drawings
- Morphing Planar Graphs in Spherical Space
- Optimal Morphs of Convex Drawings
- How to Morph Planar Graph Drawings
- Deformations of Plane Rectilinear Complexes
- Morphing orthogonal planar graph drawings
- Graph Drawing
This page was built for publication: Morphing rectangular duals
