efficient triangule fill given a set of points
Switch branches/tags
Nothing to show
Clone or download
Pull request Compare This branch is 3 commits ahead of obviousjim:master.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
example-simplePoints
libs/Delaunay/src
src
.gitignore
README.md

README.md

ofxDelaunay

Paul Bourke's Delaunay Triangulation implementation.

This is a big refactor from Julapy (Lukasz Karluk) and Pat Long's version (http://code.google.com/p/julapy/source/browse/trunk/openframeworks/ofxDelaunay/?r=708)

Changes:

  • Now uses ofMesh rather than custom data structure
  • uses std::vector for internal storage, which removes need for reallocating memory or constructor/destructors
  • Removed need for setMaxPoints(). No max points enforced