Skip to content
/ Bentley_Ottmann_algo_CompGeo Public

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).

2 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

neilmehta31/Bentley_Ottmann_algo_CompGeo

BranchesTags

Repository files navigation

Design and Analysis of algoritm Assignment 1

How to run

Run the ./run.sh file to run the algorithm followed by the plotting of the segments and the intersection points.

Usage

testcases.txt file contains the segments in the specific form of x1 y1 x2 y2.
output.txt file will contain the intersection points after running the algorithm.
plotting.py contains the python script for plotting the segment.

About

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).

Topics

computational-geometry bentley-ottmann design-and-analysis-of-algorithms

Resources

Readme
Activity

Stars

2 stars

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages