| commit | c1521f6e879881232dcddabd6c2ddb6187e8714b | [log] [tgz] |
|---|---|---|
| author | Vova Bilonenko <bilonenko.v@gmail.com> | Sun Oct 07 07:51:19 2018 +0200 |
| committer | GitHub <noreply@github.com> | Sun Oct 07 07:51:19 2018 +0200 |
| tree | 22fbcc3fea29fdd962a9d83ab59c66a65285051a | |
| parent | 393cfc39c9b1ca268081d5f42062de0d9b33f5a2 [diff] | |
| parent | 6e9799316001ccb3f1e067029a7bf9eb3b95c6e6 [diff] |
Merge pull request #12 from delfrrr/remove-recursion Remove recursion, speed up modulus
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-29 09:27:28 ------------------------------------------------------------ Benchmark Time CPU Iterations ------------------------------------------------------------ BM_45K_geojson_nodes 22 ms 22 ms 32 BM_uniform/2000 1 ms 1 ms 982 BM_uniform/100000 63 ms 62 ms 9 BM_uniform/200000 140 ms 140 ms 4 BM_uniform/500000 400 ms 399 ms 2 BM_uniform/1000000 994 ms 993 ms 1
Library is ~10% faster then JS version for 1M uniform points (details)