| Author | Message | ||
|---|---|---|---|
< extend ~ ofxDelaunay |
|||
|
|||
| Joined: Mon Dec 01, 2008 12:28 amPosts: 268Location: Vancouver, BC, Canada |
Following the discussions on triangulating concave polygons, I decided to build a nice OF wrapper for Gilles Dumoulin's C++ implementation of Paul Bourke's Delaunay Triangulation algorithm.
So, here it is, nice and simple triangulation... example included. Seems to run pretty quickly, tested it triangulating up to 1000 points at 58fps, 500 points at 60fps (with ofSetFrameRate(60)). Cheers! -plong0
Attachments:
|
||
| Top |
  |
||
|
|||
 Joined: Mon Jan 19, 2009 7:02 amPosts: 214Location: sydney |
hi plong0, thx for posting this code.
been keen to play around with delaunay triangulation for a while now. this code will be a nice leg up. thx.
|
||
| Top |
|
||
|
|||
 Joined: Sat Jul 18, 2009 9:15 amPosts: 14Location: Melbourne |
insane code,
thanks man, was about to port some delaunay based code to OF nice one
|
||
| Top |
|
||
|
|||
| Joined: Mon Dec 01, 2008 12:28 amPosts: 268Location: Vancouver, BC, Canada |
Hehe, I didn't write most of the code... I just put a nice OF add-on wrapper on it to simplify its use.
As I've mentioned and documented in the source files, the original code is from Gilles Dumoulin's C++ implementation of Paul Bourke's Delaunay Triangulation algorithm.  Glad you're finding it useful though! Enjoy!
|
||
| Top |
|
||
All times are UTC
|
Page 1 of 1
4 posts |
|---|
Users browsing this forum: ascorbin and 3 guests
| You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot post attachments in this forum |