| commit | 85629f4b0467556d3e1a6ad851cf4df4aa39e576 | [log] [tgz] |
|---|---|---|
| author | Vova Bilonenko <bilonenko.v@gmail.com> | Thu Aug 30 09:19:12 2018 +0200 |
| committer | Vova Bilonenko <bilonenko.v@gmail.com> | Thu Aug 30 09:19:12 2018 +0200 |
| tree | dfdc295101ad23d4411c526b74d19b61d4abb833 | |
| parent | a97dbdcdec11ac5492a328237042eb9ad632de0f [diff] |
remove node_modules
A really fast C++ library for Delaunay triangulation of 2D points.
delaunator-cpp is a C++ port from https://github.com/mapbox/delaunator a JavaScript implementation of very fast 2D Delaunay algorithm.
#include "delaunator.h" #include <cstdio> using namespace std; //... int main(int, char* argv[]) { //... const vector<double> coords = {/* x0, y0, x1, y1, ... */}; //triangulation happens here //note moving points to constructor Delaunator delaunator(move(coords)); for(long int i = 0; i < delaunator.triangles.size(); i+=3) { printf( "Triangle points: [[%f, %f], [%f, %f], [%f, %f]]\n", delaunator.coords[2 * delaunator.triangles[i]], //tx0 delaunator.coords[2 * delaunator.triangles[i] + 1], //ty0 delaunator.coords[2 * delaunator.triangles[i + 1]], //tx1 delaunator.coords[2 * delaunator.triangles[i + 1] + 1], //ty1 delaunator.coords[2 * delaunator.triangles[i + 2]], //tx2 delaunator.coords[2 * delaunator.triangles[i + 2] + 1], //ty2 ) } }
For full example see src/triangulate.cpp