Realization and connectivity of the graphs of origami flat foldings
From MaRDI portal
Publication:1725788
DOI10.1007/978-3-030-04414-5_38zbMath1419.05144arXiv1808.06013OpenAlexW2887977862MaRDI QIDQ1725788
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1808.06013
Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing
- A linear algorithm to find a rectangular dual of a planar triangulated graph
- Voronoi drawings of trees
- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
- Steinitz Theorems for Orthogonal Polyhedra
- Rigid Origami Vertices: Conditions and Forcing Sets
- Trees with Convex Faces and Optimal Angles
- Rectangular duals of planar graphs
- Isometric folding of Riemannian manifolds
- Curvature and Creases: A Primer on Paper
- On Finding the Rectangular Duals of Planar Triangular Graphs
- Two algorithms for finding rectangular duals of planar graphs