Pseudo-triangulation of monotone polygon using sweep line algorithm

In the field of computational geometry, pseudo-triangulation of a polygon is an interesting topic. Breaking a polygon into pseudo-triangles reduces the calculation cost and increases computational power. The sweep line algorithm also known as the plane sweep algorithm uses an imaginary line or a plain surface on the Euclidean plain to perform various computations. Finding line intersection with sweep line was a revolutionary outcome. As polygons are the combination of edges and vertices, we tried to implement the concept of a sweep line to create pseudo-triangles inside the polygon. Among the vast triangulation algorithms, a few pseudo-triangulation algorithms are available. Using the sweep line algorithm, we have been able to pseudo-triangulate a monotone polygon which uses the time complexity of to execute. As complex polygons can often be divided into a monotone polygon in just so it is possible to chain with our sweep line-based technique, any complex polygon can be pseudo-triangulated in .