CodingTrain / CodingTrain/Suggestion-Box
Coding Challenge: Sweep Line Algorithm
Open
Challenge
- Dominant language
- No language data
- Stars
- 570
- Forks
- 85
- PR merge metrics
- No merged PRs in 30d
Description
An algorithm to find all intersections for given line segments using a line sweeping through all the segments and keeping their statuses. It's also called *Bentley-Ottmann algorithm*. I guess a nice visualization in *p5* or *processing* can be made only by Daniel.
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.