pith. machine review for the scientific record. sign in

arxiv: 0911.4146 · v1 · submitted 2009-11-21 · 💻 cs.CG

Recognition: unknown

On convexification of polygons by pops

Authors on Pith no claims yet
classification 💻 cs.CG
keywords familypolygonsopenpolygonproblemadjacentalternatinganswer
0
0 comments X
read the original abstract

Given a polygon $P$ in the plane, a {\em pop} operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, and show that any polygon from this family cannot be convexified by pop operations. This family contains simple, as well as non-simple (i.e., self-intersecting) polygons, as desired. We thereby answer in the negative an open problem posed by Demaine and O'Rourke \cite[Open Problem 5.3]{DO07}.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.