Complex polygon triangulation. A fast O(n*log(n)) algorithm based on "Triangulation of monotone polygons". The result can be represented as a Delaunay triangulation.
-
Updated
Dec 19, 2023 - Swift
Complex polygon triangulation. A fast O(n*log(n)) algorithm based on "Triangulation of monotone polygons". The result can be represented as a Delaunay triangulation.
An Algorithm for Monotone Decomposition of Polygons in 2D Space
An user interface for finding approximate solutions to the Art Gallery Problem
Monotone Polygon and Vertex Guard Approximation Generator
monotone polygon triangulation - online interactive demo
Add a description, image, and links to the monotone-polygons topic page so that developers can more easily learn about it.
To associate your repository with the monotone-polygons topic, visit your repo's landing page and select "manage topics."