commit | 0e5d18ca82cb9ea95795da130c420d5800d9f31d | [log] [tgz] |
---|---|---|
author | Vova Bilonenko <bilonenko.v@gmail.com> | Wed Aug 29 07:52:51 2018 +0200 |
committer | Vova Bilonenko <bilonenko.v@gmail.com> | Wed Aug 29 07:52:51 2018 +0200 |
tree | e904cc35e9873a08549df8e98a73a8ab56a3c93e | |
parent | 319b9c98a428fa03178d4bf83c87c313cd4d7149 [diff] |
add documentation
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> //... int main(int, char* argv[]) { //... const vector<double> coords = {/* x0, y0, x1, y1, ... */}; Delaunator delaunator(coords); //triangulation happens here 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