Re: [Boost-users] Formal Review of Boost.Polygon extended one more week: until September 9, 2009

Thank you Olivier and Barend, I'll check out these suggestions. In the end i coded up something myself as i have very simple convex polygons I'm dealing with, so there are some simple tricks to compute whether the point is inside. Nonetheless, it good to know what libraries out there offer, as I'm bound tu run into more complex situations later. Best, Dee On Sat, Oct 10, 2009 at 7:01 PM, Barend Gehrels wrote:

Hi Diederick,

I've done a benchmark including point-in-polygon test and I think you can use the proposed Boost.Polygon library for this. It supports also floating point polygons and the point-in-polygon operation, and as far as I know (but Luke knows the details) there is no truncation to integer for this purpose.

Alternatively, you might have a look to the Generic Geometry Library which will be soon proposed to Boost (it has been in preview 4 times). See http://trac.osgeo.org/ggl/ where also references to documentation and SVN access are mentioned.

Regards, Barend Gehrels

_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

On Sat, Oct 10, 2009 at 4:01 PM, Olivier Tournaire wrote: Hi

If you are looking for exact geometry algorithms, you may consider using CGAL (www.cgal.org) which is highly generic and customizable. However, it might be to "rich" if you only use polygons. Take a look at this particular package http://www.cgal.org/Manual/3.5/doc_html/cgal_manual/contents.html#part_VI

Regards,

Olivier