Plane Sweep Algorithm for finding Line Segment Intersections
This is an introduction to the plane sweep technique by the example of the problem of finding all intersections of a set of line segments. Chapters: 00:00:00 introduction 00:06:03 observations 00:11:38 concepts 00:14:30 status & events 00:17:27 degenerate cases & quiz 00:20:08 data structures (for status) 00:23:37 finding events 00:25:15 data structure for events 00:28:19 plane sweep algorithm 00:30:22 event handling 00:33:12 running time 00:37:58 linear space 00:40:42 handling degenerate cases 00:42:46 conclusion Correction: 00:19:35 Here n is the number of vertices of both polygons. (thanks to @karatsurba4791 )
▶︎
Doubly-connected edge lists for planar subdivisions
▶︎
Sweep-Line Algorithm for Line Segment Intersection (2/5) | Computational Geometry - Lecture 02
▶︎
11 2 Line Segment Intersection 546
▶︎
Why Aliens Would NEVER Invade Africa
▶︎
The hidden beauty of the A* algorithm
▶︎
Voronoi diagrams (Delaunay triangulations and Voronoi diagrams, part 1)
▶︎
Sweep-Line Algorithm for Line Segment Intersection (3/5) | Computational Geometry - Lecture 02
▶︎
The FULL VIDEO of Trump they didn’t want released
▶︎
My Golden Retriever Heals a Terrified Rescue Kitten in Just 3 Meetings!
▶︎
Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker
▶︎
Check if two line segments intersect
▶︎
We're 99.9% sure this pattern is true, but no one can prove it
▶︎
How Dijkstra's Algorithm Works
▶︎
Smooth-Maximum, the most useful function
▶︎
JANITOR vs THE BIGGEST GUYS IN THE GYM. They Didn’t Expect THAT
▶︎
If You Have A Bad Memory, I’ll Help You Fix It In 28 Minutes
▶︎
Convex Hull Algorithm - Graham Scan and Jarvis March tutorial
▶︎
Line Segment Intersection
▶︎