Subject: CGAL users discussion list
List archive
- From: Stefan Schirra <>
- To:
- Subject: Re: [cgal-discuss] Point in polygon 2D (CGAL::bounded_side)
- Date: Wed, 21 Oct 2015 16:22:01 +0200
- Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None ; spf=None ; spf=None
- Ironport-phdr: 9a23:1qP6JxWnapzNaDhcQ+uGCfj99XDV8LGtZVwlr6E/grcLSJyIuqrYZhGDt8tkgFKBZ4jH8fUM07OQ6PC9HzRaqsnc+Fk5M7VyFDY9wf0MmAIhBMPXQWbaF9XNKxIAIcJZSVV+9Gu6O0UGUOz3ZlnVv2HgpWVKQka3CwN5K6zPF5LIiIzvjqbpq8CVO18D22f1SIgxBSv1hD2ZjtMRj4pmJ/R54TryiVwMRd5rw3h1L0mYhRf265T41pdi9yNNp6BprJYYAu2pN5g/GLdXBTBjP2Eu79DwrjHCSxGO7z0SSDY4iB1NVjPZ4R/zWN/KuSv7rPB0kH2BIdb9TbEuQxyj9KgtQwSulSEGcjsw/23agNFqg+RXrUTy9FRE34fIbdTNZ7JFdaTHcIZCSA==
On 15.10.2015 16:26, Volodymyr wrote:
As I can see by my tests, algorithm for detecting if point inside/outside 2d
polygon is very slow (CGAL::bounded_side).
However, even with double CGAL's implementation is fairly reliable, much more reliable than other implementations including those available on the www. See http://link.springer.com/chapter/10.1007%2F978-3-540-87744-8_62
I have another implementation of some algorithm, which is work some X times
faster.
X is about 10 (for computation with double)?
Regards,
Stefan
- [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.