Skip to content
View quimperval's full-sized avatar

Block or report quimperval

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
Showing results

Given n line segments, efficiently find all points of intersection. This is a modern C++ implementation of the Bentley-Ottman algorithm from (almost) scratch because why not.

C++ 6 1 Updated Apr 10, 2022