In this paper we introduce the class of onion polygons, specially inte
nded for solving the following problem: how to polygonize a set of poi
nts in such a way that when the convex hull is removed, the remaining
points can be polygonized quickly with minimum changes, In that sense
onion polygons can handle even more complicated situations, Moreover,
they also enjoy special good properties in other computational aspects
.