Segments intersection detection library

simple Java implementation of Bentley-Ottmann sweep line algorithm for listing all intersections in a set of line segments

Detection of line segments & polygon edges intersections

Bentley-Ottman sweepline algorithm implementation in js

This repo contains the process of implementing computational geometry algorithms such as Convex Hull, Bentley-Ottmann Sweep Line, Subdivison Intersection and Voronoi.

Fast polyline (line segments) intersection (fast version of bentley-ottmann and more than that) https://deepwiki.com/cubao/fast-crossing

Java implementation of Bentley-Ottmann segments intersection finding algorithm

Simple implementation of bentley ottmann algorithm in c++ to find intersections between segments

Bentley Ottman Algorithm to find the intersection points in the 2d plane for lines. The algorithm is input sensitive and has a running time complexity of O((N + K) log N) and space complexity of O(N).

Case study and analysis on the complexity of the Bentley-Ottman Algorithm, with firstly its development in C thanks to graph theory (binary search tree, doubly linked list), and secondly with experiments carried out on it thanks to the shell script.