commit | f61a3ae96d2ef600c4ed0c9a2bdb05990080b4f4 | [log] [tgz] |
---|---|---|
author | Vova Bilonenko <bilonenko.v@gmail.com> | Tue Sep 18 09:34:33 2018 +0200 |
committer | GitHub <noreply@github.com> | Tue Sep 18 09:34:33 2018 +0200 |
tree | c9be16dfcb829de93ec3e254659531420f626e4a | |
parent | e8cc6a3b60457304de34e0fdb97036f37526c969 [diff] | |
parent | fb9407a567567a66679a4fcfa6326cddca35f610 [diff] |
Merge pull request #8 from mourner/rand-benchmarks Add 100k/1m uniform random benchmarks
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.
delaunator@v2.0.3
examples/basic.cpp
#include <delaunator.hpp> #include <cstdio> int main() { /* x0, y0, x1, y1, ... */ std::vector<double> coords = {-1, 1, 1, 1, 1, -1, -1, -1}; //triangulation happens here delaunator::Delaunator d(coords); for(std::size_t i = 0; i < d.triangles.size(); i+=3) { printf( "Triangle points: [[%f, %f], [%f, %f], [%f, %f]]\n", d.coords[2 * d.triangles[i]], //tx0 d.coords[2 * d.triangles[i] + 1], //ty0 d.coords[2 * d.triangles[i + 1]], //tx1 d.coords[2 * d.triangles[i + 1] + 1],//ty1 d.coords[2 * d.triangles[i + 2]], //tx2 d.coords[2 * d.triangles[i + 2] + 1] //ty2 ); } }