commit | f2ef8ebd9acab89da54962010b3e088afcd438a2 | [log] [tgz] |
---|---|---|
author | Vova Bilonenko <bilonenko.v@gmail.com> | Mon Sep 10 07:49:42 2018 +0200 |
committer | Vova Bilonenko <bilonenko.v@gmail.com> | Mon Sep 10 07:49:42 2018 +0200 |
tree | b7a746aa95a817561e7d9dc4ebbdb52a4ca1be6d | |
parent | 90c90451a6f106481ecdd554c27216889d7b6cdc [diff] |
recover validate fn
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.hpp> #include <cstdio> //... int main(int, char* argv[]) { //... std::vector<double> coords = {/* x0, y0, x1, y1, ... */}; //triangulation happens here //note moving points to constructor delaunator::Delaunator delaunator(coords); for(std::size_t 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 examples/triangulate/main.cpp