delaunator-cpp
delaunator-cpp copied to clipboard
A really fast C++ library for Delaunay triangulation of 2D points
Required for std::tie. Just that
pls just add it(
CMake fails to generate the project as the URL for the mason binaries seems to be no longer valid: ``` CMake Error at cmake/mason.cmake:118 (message): [Mason] Failed to download https://mason-binaries.s3.amazonaws.com/linux-/benchmark/1.2.0.tar.gz:...
Hi, Thanks for the routine, it's crazy fast. I noticed line 306 can use std::execution::par for a tiny speedup par shaved a fair amount of time off, though using par_unseq...
``` #include int main() { std::vector coords = { 0, 0, 1022, 0, 0, 1024, 1022, 1024, 387, 403, 387.4791259765625, 403.1723327636719, 388.0328369140625, 403.0395812988281, 388.6558227539063, 402.6470947265625, 389.3426818847656, 402.0401611328125, 390.0880126953125, 401.2640380859375, 390.886474609375,...
Fixes #16 to prevent infinite recursion when a triangle was previously deleted from hull_next. Port of fix in original JavaScript https://github.com/mapbox/delaunator/issues/44
Is possible to triangulate polygon with holes ? ( attached image )  _This is the 'B' letter from Arial font, for using in the text rendering via OpenGL._
* Nice to see this work! it leaves me wondering however if your claim that the code is probably the fastest 2d triangulation tool is actually true. * CGAL has...
delaunator.hpp have not inline fubctions. In class Delaunator.