An open API service providing repository metadata for many open source software ecosystems.

Topic: "bentley-ottmann"

anvaka/isect

Segments intersection detection library

Language: JavaScript - Size: 1.59 MB - Last synced at: 2 months ago - Pushed at: 4 months ago - Stars: 279 - Forks: 19

valenpe7/bentley-ottmann

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

Language: Java - Size: 4.97 MB - Last synced at: about 2 years ago - Pushed at: over 3 years ago - Stars: 16 - Forks: 11

lycantropos/bentley_ottmann

Detection of line segments & polygon edges intersections

Language: Python - Size: 324 KB - Last synced at: 18 days ago - Pushed at: over 1 year ago - Stars: 15 - Forks: 3

ggolikov/bentley-ottman

Bentley-Ottman sweepline algorithm implementation in js

Language: JavaScript - Size: 1.04 MB - Last synced at: 29 days ago - Pushed at: over 2 years ago - Stars: 15 - Forks: 9

cubao/fast-crossing

Fast polyline (line segments) intersection (fast version of bentley-ottmann and more than that)

Language: C++ - Size: 863 KB - Last synced at: 27 days ago - Pushed at: 27 days ago - Stars: 7 - Forks: 1

the-other-mariana/computational-geometry

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

Language: Python - Size: 34.5 MB - Last synced at: over 1 year ago - Pushed at: almost 4 years ago - Stars: 6 - Forks: 0

maiconpml/bentley-ottmann

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

Language: C++ - Size: 50.8 KB - Last synced at: 7 months ago - Pushed at: 7 months ago - Stars: 3 - Forks: 0

stanislav-antonov/bentley-ottmann

Java implementation of Bentley-Ottmann segments intersection finding algorithm

Language: Java - Size: 42 KB - Last synced at: over 2 years ago - Pushed at: over 3 years ago - Stars: 3 - Forks: 4

neilmehta31/Bentley_Ottmann_algo_CompGeo

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

Language: C++ - Size: 481 KB - Last synced at: over 1 year ago - Pushed at: over 3 years ago - Stars: 2 - Forks: 0