commit | e458e1bf86801dc2814c886c484ae346aa32eef3 | [log] [tgz] |
---|---|---|
author | Vova Bilonenko <bilonenko.v@gmail.com> | Sun Sep 23 08:54:13 2018 +0200 |
committer | Vova Bilonenko <bilonenko.v@gmail.com> | Sun Sep 23 08:54:13 2018 +0200 |
tree | 485bc2369c7c324c8fcce929dcb5f4dcb870b760 | |
parent | b6a57e2c30c24948b847ad0c725fce43cf826952 [diff] |
#2 parity with js: mapbox/delaunator@760be6b
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.
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 ); } }
Run on (4 X 2300 MHz CPU s) 2018-09-23 08:36:08 ------------------------------------------------------------ Benchmark Time CPU Iterations ------------------------------------------------------------ BM_45K_geojson_nodes 22 ms 22 ms 33 BM_uniform/2000 1 ms 1 ms 953 BM_uniform/100000 61 ms 61 ms 9 BM_uniform/200000 140 ms 140 ms 4 BM_uniform/500000 409 ms 408 ms 2 BM_uniform/1000000 998 ms 995 ms 1
Library is ~10% faster then JS version for 1M uniform points (details)