Java implementation of Bentley-Ottmann segments intersection finding algorithm. When operates the algorithm takes n * log(n) time complexity whenever a naive approach has n^2.
-
Notifications
You must be signed in to change notification settings - Fork 4
Java implementation of Bentley-Ottmann segments intersection finding algorithm
License
stanislav-antonov/bentley-ottmann
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Java implementation of Bentley-Ottmann segments intersection finding algorithm
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published