Detect whether two convex polygons overlap or not.
Time complexity = O(n + m)
Where n is the size of the first polygon (number of vertices) and m is the size of the second polygon.
-
Notifications
You must be signed in to change notification settings - Fork 0
bouhao01/convex_polygons_ovelap
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Detect whether two convex polygons overlap or not
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published