Pages that link to "Item:Q1423583"
From MaRDI portal
The following pages link to Straightening polygonal arcs and convexifying polygonal cycles (Q1423583):
Displaying 43 items.
- Generic singular configurations of linkages (Q409536) (← links)
- Visibility-preserving convexifications using single-vertex moves (Q413272) (← links)
- Configuration spaces of convex and embedded polygons in the plane (Q464239) (← links)
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- Small grid embeddings of 3-polytopes (Q629826) (← links)
- Criticality for the Gehring link problem (Q860175) (← links)
- Some properties of linkage mappings (Q950814) (← links)
- Reversing a polyhedral surface by origami-deformation (Q973104) (← links)
- Flattening single-vertex origami: The non-expansive case (Q991180) (← links)
- Refolding planar polygons (Q1014339) (← links)
- Morphing polyhedra with parallel faces: Counterexamples (Q1025295) (← links)
- A note on reconfiguring tree linkages: Trees can lock (Q1348403) (← links)
- Foreword to special issue (Q1745763) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- Enumerating pseudo-triangulations in the plane (Q1776895) (← links)
- On folding of planar regular pentagon rings (Q2027111) (← links)
- Spaces of polygons degenerated to segments (Q2105028) (← links)
- Kirszbraun-type theorems for graphs (Q2312599) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Liftings and stresses for planar periodic frameworks (Q2351014) (← links)
- Free edge lengths in plane graphs (Q2354683) (← links)
- Transforming pseudo-triangulations (Q2390240) (← links)
- Convex shapes and harmonic caps (Q2398167) (← links)
- Efficient algorithms for the \(d\)-dimensional rigidity matroid of sparse graphs (Q2479473) (← links)
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings (Q2482209) (← links)
- Minimal Locked Trees (Q3183441) (← links)
- Resolving Loads with Positive Interior Stresses (Q3183482) (← links)
- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees (Q3511349) (← links)
- On the unfolding of simple closed curves (Q3623371) (← links)
- (Q5075827) (← links)
- On rigid origami I: piecewise-planar paper with straight-line creases (Q5160825) (← links)
- Pole Dancing: 3D Morphs for Tree Drawings (Q5233136) (← links)
- ON UNFOLDING LATTICE POLYGONS/TREES AND DIAMETER-4 TREES (Q5322317) (← links)
- How to Morph Planar Graph Drawings (Q5737811) (← links)
- Hinged dissections exist (Q5894520) (← links)
- Convexity-increasing morphs of planar graphs (Q5919691) (← links)
- Polygonal chains cannot lock in 4D (Q5952584) (← links)
- Reconfiguring convex polygons (Q5952973) (← links)
- Locked and unlocked chains of planar shapes (Q5962351) (← links)
- Symmetric configuration spaces of linkages (Q6074055) (← links)
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality (Q6156090) (← links)
- Distributions of points on non-extensible closed curves in \(\mathbb{R}^3\) realizing maximum energies (Q6157848) (← links)
- (Q6179337) (← links)
