Reconfiguring convex polygons

DOI10.1016/S0925-7721(01)00037-2MaRDI QIDQ5952973zbMATH OpenFDO

Authors Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael Soss, Godfried Toussaint

Publication date 14 January 2002

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0925-7721(01)00037-2

zbMATH Keywords

convex polygon

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1522946
• Mathematical Foundations of Computer Science 2004
• Straightening polygonal arcs and convexifying polygonal cycles
• Visibility-preserving convexifications using single-vertex moves
• Reconfiguring closed polygonal chains in Euclidean \(d\)-space

Cites work

• Convexifying polygons with simple projections
• scientific article; zbMATH DE number 3119278 (Why is no real title available?)
• scientific article; zbMATH DE number 3509333 (Why is no real title available?)
• scientific article; zbMATH DE number 1305492 (Why is no real title available?)
• scientific article; zbMATH DE number 1026567 (Why is no real title available?)
• scientific article; zbMATH DE number 1522946 (Why is no real title available?)
• scientific article; zbMATH DE number 201032 (Why is no real title available?)
• KNOTTING OF REGULAR POLYGONS IN 3-SPACE
• NONTRIVIAL EMBEDDINGS OF POLYGONAL INTERVALS AND UNKNOTS IN 3-SPACE
• On Cauchy's Lemma Concerning Convex Polygons
• On the existence and constructibility of inscribed polygons
• Polygonal chains cannot lock in 4D
• Reconfiguring closed polygonal chains in Euclidean \(d\)-space
• Straightening polygonal arcs and convexifying polygonal cycles
• Stretching chords of space curves
• The pivot algorithm and polygons: results on the FCC lattice
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.

Cited in

(18)

• Refolding planar polygons
• Convexifying polygons with simple projections
• Motion planning and control of a planar polygonal linkage
• Strongly-Delaunay starshaped polygons
• The Erdős--Nagy theorem and its ramifications
• Isometric deformations of planar quadrilaterals with constant index
• Computing signed permutations of polygons
• scientific article; zbMATH DE number 5999543 (Why is no real title available?)
• Reconfiguration of convex cyclic quadrilaterals
• Reconfiguration of polygons
• On the unfolding of simple closed curves
• Visibility-preserving convexifications using single-vertex moves
• scientific article; zbMATH DE number 1522946 (Why is no real title available?)
• Configuration spaces of convex and embedded polygons in the plane
• Convexifying monotone polygons while maintaining internal visibility
• Connecting polygonizations via stretches and twangs
• Mathematical Foundations of Computer Science 2004
• On convexification of polygons by pops

This page was built for publication: Reconfiguring convex polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952973)