Improved Triangulation: An optimized O (n+slogs) sweep-line algorithm (where s is the number of "start" vertices), drastically reducing the impact of non-convexity on performance. Basic Triangulation: ...

This is a Python implementation of the paper "A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons" by Raimund Seidel (1991).

Abstract: Positioning is a fundamental issue in mobile robot applications. It can be achieved in many ways. Among them, triangulation based on angles measured with the help of beacons is a proven ...

Abstract: This paper presents a fast incremental insertion algorithm for constructing constrained Delaunay triangulation. Constraints are considered any kind of polygonal lines. The bottleneck of ...