Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP

efficient triangule fill given a set of points

branch: master
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
Something went wrong with that request. Please try again.