tcoppex / Polytri
Licence: unlicense
🔺 Fast and simple polygon triangulation library.
Stars: ✠37
Projects that are alternatives of or similar to Polytri
Computational Geometry
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh simplification, etc
Stars: ✠325 (+778.38%)
Mutual labels: computational-geometry, triangulation
Delaunator
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
Stars: ✠1,641 (+4335.14%)
Mutual labels: computational-geometry, triangulation
Earcut
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Stars: ✠1,359 (+3572.97%)
Mutual labels: computational-geometry, triangulation
Cdt
C++ library for constrained Delaunay triangulation (CDT)
Stars: ✠165 (+345.95%)
Mutual labels: computational-geometry, triangulation
Delaunator Cpp
A really fast C++ library for Delaunay triangulation of 2D points
Stars: ✠244 (+559.46%)
Mutual labels: computational-geometry, triangulation
Cgal
The public CGAL repository, see the README below
Stars: ✠2,825 (+7535.14%)
Mutual labels: computational-geometry, triangulation
Hxgeomalgo
Small collection of computational geometry algorithms in Haxe.
Stars: ✠133 (+259.46%)
Mutual labels: computational-geometry, triangulation
Tinfour
Delaunay and Constrained Delaunay Triangulations in Java, providing high-performance utilities for modeling surfaces with support for Lidar LAS files, Digital Elevation Models (DEM), finite element analysis, path planning, natural neighbor interpolation, and other applications of Triangulated Irregular Networks (TIN)
Stars: ✠119 (+221.62%)
Mutual labels: triangulation, computational-geometry
SplashGeom
Open-source C++ library for geometry and linear algebra
Stars: ✠22 (-40.54%)
Mutual labels: triangulation, computational-geometry
Geometry
Boost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75
Stars: ✠282 (+662.16%)
Mutual labels: computational-geometry
Qhull
Qhull development for www.qhull.org -- Qhull 8.0.2 (2020.2 candidate) at https://github.com/qhull/qhull/wiki
Stars: ✠400 (+981.08%)
Mutual labels: computational-geometry
Hootenanny
Hootenanny conflates multiple maps into a single seamless map.
Stars: ✠264 (+613.51%)
Mutual labels: computational-geometry
Grassmann.jl
⟨Leibniz-Grassmann-Clifford⟩ differential geometric algebra / multivector simplicial complex
Stars: ✠289 (+681.08%)
Mutual labels: computational-geometry
Geopython
Notebooks and libraries for spatial/geo Python explorations
Stars: ✠268 (+624.32%)
Mutual labels: computational-geometry
Turf
A modular geospatial engine written in JavaScript
Stars: ✠6,659 (+17897.3%)
Mutual labels: computational-geometry
Mapillary Js
Interactive, customizable street imagery viewer in the browser, powered by WebGL
Stars: ✠261 (+605.41%)
Mutual labels: computational-geometry
Dgtal
Digital Geometry Tools and Algorithm Library
Stars: ✠259 (+600%)
Mutual labels: computational-geometry
Pmp Library
The Polygon Mesh Processing Library
Stars: ✠524 (+1316.22%)
Mutual labels: triangulation
polytri
PolyTri is a polygon triangulator for simple polygons based on Seidel's algorithm [1].
Quickstart
To build the static library and a simple command line tool, open a terminal and type :
$ mkdir build && cd build
$ cmake .. -G Makefile -DCMAKE_BUILD_TYPE=Release
$ make -j7
You can then run the command line tool by typing :
$ polytri-cli ../shape.data
Finally to display the result type :
firefox -new-window ../tools/polygon.html
References
- [1] R. Seidel. A simple and fast incremental randomized algorithm for comput ing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl., 1:51–64, 1991.
- [2] A. Narkhede and D. Manocha, Fast Polygon Triangulation Based on Seidel's Algorithm
- [3] Fournier, Alain & Montuno, Delfin. (1984). Triangulating Simple Polygons and Equivalent Problems. ACM Trans. Graph.. 3. 153-174. 10.1145/357337.357341.
- [4] M. de Berg, O. Cheong, M. van Kreveld, M. Overmars. Computational Geometry, Algorithms and Applications, Third Edition, Chap. 3 Polygon Triangulation, Springer, 2008.
Alternative
- Triangle, A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator.
License
PolyTri is released under the Unlicense.
Note that the project description data, including the texts, logos, images, and/or trademarks,
for each open source project belongs to its rightful owner.
If you wish to add or remove any projects, please contact us at [email protected].