Straightening polygonal arcs and convexifying polygonal cycles
From MaRDI portal
(Redirected from Publication:1423583)
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
Recommendations
- scientific article; zbMATH DE number 510868
- Progressive simplification of polygonal curves
- Approximating Polygonal Curves in Two and Three Dimensions
- Polygonal path simplification with angle constraints
- Convexification of polygons by length preserving transformations
- Polynomially convex arcs in polynomially convex simple closed curves
- Conformal Mapping of Circular Arc Polygons
- scientific article; zbMATH DE number 4074316
- scientific article; zbMATH DE number 822259
- Polygonal approximation of closed discrete curves
Cited in
(54)- Distributions of points on non-extensible closed curves in \(\mathbb{R}^3\) realizing maximum energies
- Kirszbraun-type theorems for graphs
- Closing curves by rearranging arcs
- On the unfolding of simple closed curves
- Criticality for the Gehring link problem
- Spaces of polygons degenerated to segments
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- Constructive Whitney–Graustein Theorem: Or How to Untangle Closed Planar Curves
- Locked and unlocked smooth embeddings of surfaces
- Generic singular configurations of linkages
- How to morph planar graph drawings
- Acute triangulations of polygons
- Reversing a polyhedral surface by origami-deformation
- Visibility-preserving convexifications using single-vertex moves
- Connecting polygonizations via stretches and twangs
- Minimal Locked Trees
- Convexity-increasing morphs of planar graphs
- Isometric deformations of planar quadrilaterals with constant index
- Nonconvex cases for carpenter's rulers
- Flattening single-vertex origami: The non-expansive case
- Planar minimally rigid graphs and pseudo-triangulations
- Free edge lengths in plane graphs
- Recognizing planar Laman graphs
- Economical isotopies of piecewise linear arcs in the plane
- Symmetric configuration spaces of linkages
- On folding of planar regular pentagon rings
- Pole dancing: 3D morphs for tree drawings
- Introduction to reconfiguration
- Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs
- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees
- Configuration spaces of convex and embedded polygons in the plane
- Minimum separator reconfiguration
- Morphing polyhedra with parallel faces: Counterexamples
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
- Hinged dissections exist
- Small grid embeddings of 3-polytopes
- Reconfiguring convex polygons
- Relative convex hulls in semi-dynamic arrangements
- A note on reconfiguring tree linkages: Trees can lock
- A Trivial Link with no Linear Unlinking
- Enumerating pseudo-triangulations in the plane
- ON UNFOLDING LATTICE POLYGONS/TREES AND DIAMETER-4 TREES
- Locked and unlocked chains of planar shapes
- scientific article; zbMATH DE number 1746661 (Why is no real title available?)
- Convex shapes and harmonic caps
- Refolding planar polygons
- scientific article; zbMATH DE number 1786522 (Why is no real title available?)
- Resolving Loads with Positive Interior Stresses
- Transforming pseudo-triangulations
- On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
- Polygonal chains cannot lock in 4D
- Foreword to special issue
- On rigid origami I: piecewise-planar paper with straight-line creases
- Some properties of linkage mappings
This page was built for publication: Straightening polygonal arcs and convexifying polygonal cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1423583)
