# On convexification of polygons by pops - Computer Science > Computational Geometry

On convexification of polygons by pops - Computer Science > Computational Geometry - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Given a polygon $P$ in the plane, a {\em pop} operation is the reflection ofa vertex with respect to the line through its adjacent vertices. We define afamily of alternating polygons, and show that any polygon from this familycannot be convexified by pop operations. This family contains simple, as wellas non-simple i.e., self-intersecting polygons, as desired. We thereby answerin the negative an open problem posed by Demaine and O-Rourke \citeOpenProblem 5.3{DO07}.

Autor: Adrian Dumitrescu, Evan Hilscher

Fuente: https://arxiv.org/