Voronoi Diagram (5/5) | Computational Geometry

Voronoi Diagram (5/5) | Computational Geometry - Lecture 07

Рет қаралды 11,741

Күн бұрын

Computational Geometry
Lecture 07: Voronoi Diagram
Part V: Fortune's Sweep
Philipp Kindermann
Playlist: • Voronoi Diagrams | Com...
Slides: algo.uni-trier.de/lectures/al...
Full course: / @philippkindermann

Пікірлер: 16

@fernandovmennn 4 жыл бұрын

thanks for making this lessons public. I've been trying to makes sense of the original Fortune's paper but it can get pretty heavy and thanks to your lesson everything is starting to make more sense now

@sebastianschimper5556 3 жыл бұрын

Thank you very much for making your lectures publicly available. They are a great help to me.

@TheNinjaDwarfBiker Жыл бұрын

This is hands down the best explanation of algorithms with Voronoi Diagrams.

@MaheshKumar-iw4mv 2 жыл бұрын

Simply put , beautiful and elegant presentation of the algorithm and about Voronoi diagram!

@yanniskyriako5170 3 жыл бұрын

Thanks for this lessons ! You are a Legend!

@fariahuq6473 3 жыл бұрын

Thank you so much for such clear and easily understandable lectures!

@MyProceduralMap Жыл бұрын

Philipp TY SO MUCH!!!

@finn9233 2 жыл бұрын

Thank you, that was a great lecture!

@mariovelez578 3 жыл бұрын

I'm having trouble finding the parabola directly above the new site using the tree

@innokentiyromanchenko1450 8 ай бұрын

how to find arc in 2:30?

@Ropush 2 жыл бұрын

Great lecture! Now for the hard part of actually coding it

@HDv2b 2 жыл бұрын

Thanks so much for this. I want to create a Voronoi diagram but each site is a segment instead of a point, of random length, position and alignment (so potentially intersecting also). I feel like this video is the closest I've found that'll help me achieve this, but do you have any further considerations or suggestions for this goal?

@PhilippKindermann 2 жыл бұрын

Hey Hussein, this is a much tougher problem, but I can give you some pointers that might help you. There are some theoretical papers for this, you can start from the following two: Christoph Burnikel, Kurt Mehlhorn and Stefan Schirra: "How to compute the Voronoi diagram of line segments: Theoretical and experimental results". ESA 1994 link.springer.com/chapter/10.1007%2FBFb0049411 Sang Won Bae: "An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments". CGTA 52, 2016 www.sciencedirect.com/science/article/pii/S092577211500125X There are also some implementations, but I haven't tested them: ArcGIS: github.com/UNTGeography/VoronoiDiagramsGIS C#: github.com/fabanc/SharpBoostVoronoi Python: github.com/Voxel8/pyvoronoi I hope that this can help you!

@HDv2b 2 жыл бұрын

@@PhilippKindermann thank you so much!