Subject: CGAL users discussion list
List archive
- From: Remi <>
- To:
- Subject: [cgal-discuss] is_simple() precondition in Polygon_2 algorithms
- Date: Wed, 29 Sep 2010 20:56:55 +0200
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:date:message-id:subject:from:to:content-type; b=qLlPJ9p17WWinUNytqoSmAK92WrGw/CNmLXWr7RMCHw3A563ZC5wFPJvdj2F6w/igQ /5hdK9pLHnkMJDwU+Pe6HweGqNp4ZLbruHtwqpG+GMECGCgA3ftVshzVDd75wfdfNrX3 nQHdCASHx8gvuW1RzN1gdU3BWZo2CvojGhtCU=
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?
- [cgal-discuss] is_simple() precondition in Polygon_2 algorithms, Remi, 09/29/2010
- Re: [cgal-discuss] is_simple() precondition in Polygon_2 algorithms, Stefan Schirra, 09/30/2010
- Re: [cgal-discuss] is_simple() precondition in Polygon_2 algorithms, Remi, 09/30/2010
- Re: [cgal-discuss] is_simple() precondition in Polygon_2 algorithms, efif, 09/30/2010
- Re: [cgal-discuss] is_simple() precondition in Polygon_2 algorithms, Remi, 09/30/2010
- Re: [cgal-discuss] is_simple() precondition in Polygon_2 algorithms, Stefan Schirra, 09/30/2010
Archive powered by MHonArc 2.6.16.