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).

Posted by at

6 comments:

  1. iamvfx15 January 2013 at 07:57

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

    ReplyDelete
  2. Julian Johnson16 January 2013 at 05:18

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

    ReplyDelete
    Replies
    1. iamvfx18 January 2013 at 05:15

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

      Delete
  3. rumlab14 May 2014 at 04:02

    Very interested in the source on this, but the link only provides addon?
    Thanks!

    ReplyDelete
    Replies
    1. Julian Johnson14 May 2014 at 22:13

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

      Delete
  4. rumlab16 May 2014 at 10:15

    Ok, 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

Subscribe to: Post Comments (Atom)