efficient triangule fill given a set of points
Switch branches/tags
Nothing to show
Clone or download
prisonerjohn Merge branch 'reordering' of https://github.com/micuat/ofxDelaunay
Conflicts:
	src/ofxDelaunay.cpp
	src/ofxDelaunay.h
Latest commit d87a0b5 Jan 28, 2015
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
example-simplePoints glut init fix Feb 15, 2014
libs/Delaunay/src Cleaned up lib files. Jan 28, 2015
src Merge branch 'reordering' of https://github.com/micuat/ofxDelaunay Jan 28, 2015
.gitignore removed Xcode user data Feb 28, 2013
README.md read me update and white space fix Jun 25, 2012

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