Subject: CGAL users discussion list
List archive
- From: Volodymyr <>
- To:
- Subject: [cgal-discuss] Point in polygon 2D (CGAL::bounded_side)
- Date: Thu, 15 Oct 2015 07:26:45 -0700 (PDT)
- Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=SoftFail ; spf=None
- Ironport-phdr: 9a23:nFCbAR0FICCb3rYBsmDT+DRfVm0co7zxezQtwd8ZsegTK/ad9pjvdHbS+e9qxAeQG96Lt7QU2qGJ7+jJYi8p39WoiDg6aptCVhsI2409vjcLJ4q7M3D9N+PgdCcgHc5PBxdP9nC/NlVJSo6lPwWB6kO74TNaIBjjLw09fr2zQd6OyZTmnL/us7ToICx2xxOFKYtoKxu3qQiD/uI3uqBFbpgL9x3Sv3FTcP5Xz247bXianhL7+9vitMU7q3cYjdt6qZ8FCP2yP/9gFf0LRAghZms67cmuuRjYRhaU/VMdVH8Xm1xGGVvr9hb/C6n2tiz2p+9swmHOJsT1V7EvRSSK4KJiSRuugyACYW1quFrLg9B92fsI6CmqoAZyltWMOIw=
As I can see by my tests, algorithm for detecting if point inside/outside 2d
polygon is very slow (CGAL::bounded_side).
Dose anybody have plans to improve this? Or any
suggestions/guides/specifications for this?
I have another implementation of some algorithm, which is work some X times
faster. And thinking try integrate it and check if it will improve or affect
anything.
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Point-in-polygon-2D-CGAL-bounded-side-tp4661239.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] Point in polygon 2D (CGAL::bounded_side), Volodymyr, 10/15/2015
- Re: [cgal-discuss] Point in polygon 2D (CGAL::bounded_side), Stefan Schirra, 10/21/2015
Archive powered by MHonArc 2.6.18.