| commit | 0b0d9d4d81082c8c07c4d5eb9cdb1719a176ec9f | [log] [tgz] |
|---|---|---|
| author | Vova Bilonenko <bilonenko.v@gmail.com> | Mon Sep 17 10:00:55 2018 +0200 |
| committer | Vova Bilonenko <bilonenko.v@gmail.com> | Mon Sep 17 10:00:55 2018 +0200 |
| tree | 758f3cb9f0b2c14a47f9932ad89acc889f58f4cc | |
| parent | 5ba668d82bbc76d3ed154b6182d287fb7bd6f435 [diff] |
#2 parity with js: mapbox/delaunator@dcfaf92
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 ); } }