Sweep-Line Algorithm for Line Segment Intersection (2/5) | Computational Geometry - Lecture 02

Computational Geometry
Lecture 02: Sweep-Line Algorithm for Line Segment Intersection
Part II: Sweep-Line Algorithm
Philipp Kindermann

[oODomeeOo]

Vielen Dank für die Videos! Ich belege aktuell Algorithmische Geometrie an der Fernuni Hagen und es ist dann doch sehr hilfreich, wenn einem der Stoff so anschaulich präsentiert wird, statt nur ein Skript zu lesen. :)

[fertwvnbxcbwrtrecvbvcx]

This is really good. Please also upload further lectures!

[juliuslirr]

Thank you for making this available to the public! Great explanation

[karatsurba]

Thanks for sharing the knowledge Professor.

[alexandrebergeron]

Thank you for the explanation, the visual demonstration and walkthrough was great

[anirudhmenon]

Your explanation- Amazing!
Your accent - Even better!
Thanks for the great work. Keep the video's coming!

[axelmuller]

The first time my prof could explain a topic better than the YouTube

[GRATST]

The best explanation out there, thank you so much!

[gagra]

Hey, Phillip! Thanks for a cool explanation. Wouldn't it be more appropriate to use a heap data structure in order to keep trask of sweep line motion? It seems that the only operation that we need for this part of the algorithm is actually "get the topmost point" and such an operation is provided by the max binary heap with the same algorithmic complexity as a BST (log(n)) but with less overhead for pointers and stuff. What do you think?

[sergiocalad]

Excelent explanation. Can you explain Vatti's algorithm?

[AndresFH]

It is a great explanation, thank you!

[Cabot]

Amazingly helpful lesson. I'm trying to compute the visibility polygon of line segments using an angular sweep line algorithm, and your explanation is very easy to understand. Thank you!

[CodeEver]

I expected the first Data Structure to be a maxHeap, since it will be way easier to get this done through a heap where we just need the maximum intersection point. Great explanation nonetheless

[TrucNguyen-uykw]

how can i know one line between two line segment other ?

[Pkroc]

Which did software you use to do this presentation.?

[petar]

I have one question about the algorithm, let's say we were interested in only counting the intersections that are not using an endpoint of a segment, in the example, there is only one such intersection (the first red dot). So, can we use the sweep line method just to detect these intersections, thus the runtime would be O(I).

[jknair]

Dude looks like american, sound like indian.
I meant no insult, I just meant you got all to be a tutor online.