CGAL users discussion list

[Stefan Schirra <>]

 What does "relatively simple polygon" mean? (touching and overlapping 
is allowed, but crossing is not, or only corner points might overlap or 
...?)

-- Stefan


> I was wondering whether this is always unavoidable. Do all operations
> really require that the polygon should be simple instead of being
> relatively simple?
> In particular, can't the current implementation of
> Bounded_side bounded_side(const Point_2&  value) const
> work with a relatively simple polygon? If not, then I need to ask
> whether there is an algorithm for the point in polygon test that
> correctly handles relatively simple polygons?