Geek Answers Handbook

What happened to python bindings for CGAL?

I found the Computing Geometry Algorithm Library in my search for an algorithm for decomposing a concave polygon into a minimum number of convex components. Links from the site and numerous Google results show that there are python bindings for it, which would be very convenient, but all the links are dead! What happened to him? Where can i get it now?

+7
python geometry polygon computational-geometry cgal
source share
5 answers

CGAL-Python binding rewriting was done as part of the cgal-bindings project. Check it out: http://code.google.com/p/cgal-bindings/

+11
source share

CGAL-Python has been inert for over a year now, but the code (available via the Download link) seems to work fine, although not with Python 3.

+3
source share

The fastest one will probably just look at the code and reimplement it yourself in python. transferring the entire CGAL just for this tiny bit seems redundant.
In addition, this calculation does not strike me as something that would be extremely useful if compiled.

+1
source share

You may also be interested in the GEOS library, which is available in Python through Shapely and the GEOS API included in GeoDjango .

+1
source share

CGAL bindings are intrinsically complex. Since the library is largely based on a template, there is a combinatorial explosion of possible ways to use it. Any bindings should choose and choose what to include.

However: The Python package demakein (which I wrote) includes a module for compiling C ++ fragments on the fly, and then loads them using cffi. Code snippets are cached to speed up subsequent launches. There is code that wraps the parts of the CGAL that I need, they are probably different from what you need, but should give you an idea of ​​how to use it. It can be used with CPython or PyPy on Linux or OS X.

+1
source share

More articles:


All Articles