https://github.com/obviousjim/ofxDelaunay

efficient triangule fill given a set of points
https://github.com/obviousjim/ofxDelaunay

Last synced: 7 days ago
JSON representation

efficient triangule fill given a set of points

• Host: GitHub
• URL: https://github.com/obviousjim/ofxDelaunay
• Owner: obviousjim
• Created: 2012-02-17T23:08:48.000Z (over 12 years ago)
• Default Branch: master
• Last Pushed: 2019-10-10T18:44:16.000Z (about 5 years ago)
• Last Synced: 2024-10-28T14:07:27.003Z (16 days ago)
• Language: C++
• Homepage:
• Size: 192 KB
• Stars: 129
• Watchers: 14
• Forks: 73
• Open Issues: 10
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# 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