Reconfiguring convex polygons

DOI10.1016/S0925-7721(01)00037-2zbMATH Open0991.68121MaRDI QIDQ5952973FDOQ5952973

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)

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

zbMATH Keywords

convex polygon

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

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

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)