Straightening polygonal arcs and convexifying polygonal cycles

DOI10.1007/s00454-003-0006-7zbMath1046.52016OpenAlexW2068564171WikidataQ55967391 ScholiaQ55967391MaRDI QIDQ1423583

Günter Rote, Erik D. Demaine, Robert Connelly

Publication date: 7 March 2004

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-003-0006-7

zbMATH Keywords

symmetrysmoothnessplanarizationexpansivenessplanar linkagetopology of configuration spacesequilibrium stressesinfinitesimal motionspolyhedral graphcarpenter's rule problemglobal motionMaxwell-Cremona correspondencearc straightened by a motionbar frameworkconvexifying a polygonincreasing areanested arcouter-convex configurationplanar polygonal arc

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Generalized quadrangles and generalized polygons in finite geometry (51E12) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Chain complexes in algebraic topology (55U15)

Related Items

A note on reconfiguring tree linkages: Trees can lock ⋮ Minimal Locked Trees ⋮ Resolving Loads with Positive Interior Stresses ⋮ Transforming pseudo-triangulations ⋮ Criticality for the Gehring link problem ⋮ Convex shapes and harmonic caps ⋮ ON UNFOLDING LATTICE POLYGONS/TREES AND DIAMETER-4 TREES ⋮ Symmetric configuration spaces of linkages ⋮ Generic singular configurations of linkages ⋮ Visibility-preserving convexifications using single-vertex moves ⋮ Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality ⋮ Distributions of points on non-extensible closed curves in \(\mathbb{R}^3\) realizing maximum energies ⋮ On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees ⋮ Small grid embeddings of 3-polytopes ⋮ Unnamed Item ⋮ Configuration spaces of convex and embedded polygons in the plane ⋮ Relative convex hulls in semi-dynamic arrangements ⋮ Hinged dissections exist ⋮ Foreword to special issue ⋮ Some properties of linkage mappings ⋮ On rigid origami I: piecewise-planar paper with straight-line creases ⋮ Efficient algorithms for the \(d\)-dimensional rigidity matroid of sparse graphs ⋮ Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings ⋮ How to Morph Planar Graph Drawings ⋮ Reversing a polyhedral surface by origami-deformation ⋮ Unnamed Item ⋮ Planar minimally rigid graphs and pseudo-triangulations ⋮ Enumerating pseudo-triangulations in the plane ⋮ Polygonal chains cannot lock in 4D ⋮ Reconfiguring convex polygons ⋮ On folding of planar regular pentagon rings ⋮ Flattening single-vertex origami: The non-expansive case ⋮ Convexity-increasing morphs of planar graphs ⋮ Locked and unlocked chains of planar shapes ⋮ On the unfolding of simple closed curves ⋮ Refolding planar polygons ⋮ Morphing polyhedra with parallel faces: Counterexamples ⋮ Kirszbraun-type theorems for graphs ⋮ Pole Dancing: 3D Morphs for Tree Drawings ⋮ Introduction to reconfiguration ⋮ Spaces of polygons degenerated to segments ⋮ Liftings and stresses for planar periodic frameworks ⋮ Free edge lengths in plane graphs

This page was built for publication: Straightening polygonal arcs and convexifying polygonal cycles