| commit | 910a1f867eca85b86850e1e4088df0f4cf0d8eb8 | [log] [tgz] |
|---|---|---|
| author | Vova Bilonenko <bilonenko.v@gmail.com> | Mon Sep 10 09:44:02 2018 +0200 |
| committer | Vova Bilonenko <bilonenko.v@gmail.com> | Mon Sep 10 09:44:02 2018 +0200 |
| tree | e30f67aa4ce52c370cad3549eebfda84714c0599 | |
| parent | b59810e35b76993bd93aa8e749daa7ae28e93b94 [diff] |
reorganize examples
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 ); } }