## Friday, 21 December 2012

### Convex Hull Using CGAL Library

Although Guillaume Laforge has posted the definitive Convex Hull node for ICE, I thought it would be an interesting exercise to try and hook into the CGAL geometry library and see if it was possible to use their Convex Hull (Qhull) algorithm in an ICE node. It turned out to be relatively straightforward. The Addon and C++ source is here (2013SP1, 64bit only. Only tested on a couple of machines, let me know if there are any floating dependencies I may have missed).

Subscribe to:
Post Comments (Atom)

Would be really cool if I could feed custom per point IDs to create different polygon islands, just to avoid repeat node

ReplyDeleteHi iamvfx, I'll have a look and see if that's easily doable as soon as I get a chance....

ReplyDeleteI'm sure it's not, please do so only if you have no other plans!

DeleteVery interested in the source on this, but the link only provides addon?

ReplyDeleteThanks!

Hi rumlab, source is in the src folder in the Addons directory once you install the addon..

DeleteOk, don't know much about addons/programming, but have at collegue who wanted to look into it, to make spatial voronoi diagrams... Maybe your setup can be a basis. Thx

ReplyDelete