Reconfiguring convex polygons

DOI10.1016/S0925-7721(01)00037-2zbMath0991.68121MaRDI QIDQ5952973

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

Publication date: 14 January 2002

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

convex polygon

Mathematics Subject Classification ID

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

Related Items (6)

Configuration spaces of convex and embedded polygons in the plane ⋮ Motion planning and control of a planar polygonal linkage ⋮ The Erdős--Nagy theorem and its ramifications ⋮ On convexification of polygons by pops ⋮ Refolding planar polygons ⋮ Convexifying polygons with simple projections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence and constructibility of inscribed polygons
• Reconfiguring closed polygonal chains in Euclidean \(d\)-space
• Straightening polygonal arcs and convexifying polygonal cycles
• Convexifying polygons with simple projections
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• Stretching chords of space curves
• The pivot algorithm and polygons: results on the FCC lattice
• NONTRIVIAL EMBEDDINGS OF POLYGONAL INTERVALS AND UNKNOTS IN 3-SPACE
• KNOTTING OF REGULAR POLYGONS IN 3-SPACE
• On Cauchy's Lemma Concerning Convex Polygons
• Polygonal chains cannot lock in 4D

This page was built for publication: Reconfiguring convex polygons