Planar and Toroidal Morphs Made Easier
From MaRDI portal
Publication:5886038
DOI10.7155/JGAA.00616OpenAlexW4322096356MaRDI QIDQ5886038
Publication date: 30 March 2023
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00616
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deformations of plane graphs
- The space of simplexwise linear homeomorphisms of a convex 2-disk
- Simplicial energy and simplicial harmonic maps
- Convex drawings of hierarchical planar graphs and clustered planar graphs
- A paradigm for robust geometric algorithms
- How to change a triangulation of a surface into a geodesic triangulation?
- How to morph tilings injectively
- Circle packings of maps in polynomial time
- Parametrization and smooth approximation of surface triangulations
- Tutte's barycenter method applied to isotopies
- Equilibrium placement of periodic graphs and convexity of plane tilings
- Planar minimally rigid graphs and pseudo-triangulations
- From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs
- Planar and toroidal morphs made easier
- Spaces of geodesic triangulations of surfaces
- Mean value coordinates
- Testing graph isotopy on surfaces
- Realization spaces of polytopes
- Discrete one-forms on meshes and applications to 3D mesh parameterization
- Isotropic deformations of geodesic complexes on the 2-sphere and on the plane
- Powers of tensors and fast matrix multiplication
- Fast triangulation of the plane with respect to simple polygons
- Isometries Homotopic to the Identity
- Generalized Nested Dissection
- Tutte's spring theorem
- Circle packings of maps —The Euclidean case
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- INTRINSIC MORPHING OF COMPATIBLE TRIANGULATIONS
- Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
- An Elementary Proof of a Matrix Tree Theorem for Directed Graphs
- Graph Drawing
- Optimal Morphs of Convex Drawings
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- How to Draw a Graph
- How to Morph Planar Graph Drawings
- Deformations of Plane Rectilinear Complexes
- Upward planar morphs
- Convexity-increasing morphs of planar graphs
This page was built for publication: Planar and Toroidal Morphs Made Easier
