Topological morphing of planar graphs

DOI10.1016/J.TCS.2013.08.018zbMATH Open1278.05078OpenAlexW4213088702MaRDI QIDQ386891FDOQ386891

Authors: Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani 

Publication date: 11 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://link.springer.com/chapter/10.1007/978-3-642-00219-9_15

Recommendations

• Morphing Planar Graph Drawings Efficiently
• Morphing planar graph drawings with bent edges
• Morphing planar graph drawings with bent edges
• Morphing Planar Graph Drawings Optimally
• How to morph planar graph drawings

zbMATH Keywords

geometric morphing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Representations by contact and intersection of segments
• Title not available (Why is that?)
• Title not available (Why is that?)
• On-Line Planarity Testing
• Title not available (Why is that?)
• On the complexity of embedding planar graphs to minimize certain distance measures
• Testing planarity of partially embedded graphs
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Morphing Planar Graph Drawings Efficiently
• Morphing planar graph drawings with bent edges
• Determining the Smallest k Such That G Is k-Outerplanar
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
• Computing orthogonal drawings with the minimum number of bends
• \(h\)-quasi planar drawings of bounded treewidth graphs in linear area
• Morphing Planar Graphs in Spherical Space
• Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
• Morphing planar graph drawings with a polynomial number of steps
• Deformations of Plane Rectilinear Complexes
• Graph Drawing
• Graph Drawing
• Sorting circular permutations by reversal.
• Morphing orthogonal planar graph drawings
• Deformations of plane graphs
• Advances on sorting by reversals

Cited In (6)

• Discrete and Computational Geometry
• Convexity-increasing morphs of planar graphs
• Title not available (Why is that?)
• Polyline drawings with topological constraints
• Title not available (Why is that?)
• Graph Drawing

Uses Software

• PIGALE

This page was built for publication: Topological morphing of planar graphs

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