On convexification of polygons by pops

Details On convexification of polygons by pops On convexification of polygons by pops

2009-11-21

arxiv.org/abs/0911.4146v1

Computer Science

Computational Geometry

6 pages, 2 figures

Scientific paper

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}.

Affiliated with

Also associated with

No associations

Rating

On convexification of polygons by pops does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On convexification of polygons by pops, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On convexification of polygons by pops will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-315818