commit | 972e94d8754687de93d9cc9f753b20a1cb77d8f8 | [log] [tgz] |
---|---|---|
author | Vova Bilonenko <bilonenko.v@gmail.com> | Wed Sep 12 07:41:13 2018 +0200 |
committer | Vova Bilonenko <bilonenko.v@gmail.com> | Wed Sep 12 07:41:13 2018 +0200 |
tree | 9a138b06ba3b4cbc570e4466698b5e2c4238208f | |
parent | 04ccec21303ff7d0c2dc66f9cdc1d133c32ca11f [diff] |
use benchmark definitions as suggested by docs
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 ); } }