Topological morphing of planar graphs

DOI10.1016/J.TCS.2013.08.018MaRDI QIDQ386891zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(6)

• Discrete and Computational Geometry
• Convexity-increasing morphs of planar graphs
• scientific article; zbMATH DE number 7692359 (Why is no real title available?)
• Polyline drawings with topological constraints
• scientific article; zbMATH DE number 5037083 (Why is no real title available?)
• Graph Drawing

Describes a project that uses

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)