Youtor
A simple algorithm for 2D Voronoi diagrams
>> YOUR LINK HERE: ___ http://youtube.com/watch?v=I6Fen2Ac-1U
In this video we will learn a simple algorithm for generating Voronoi diagrams. Given a set of points on the plane, the idea is to create, for each point, a polygon that encloses the region of the plane that is closest to that point. • Voronoi diagrams are a type of spatial partitioning diagram that divide a plane into regions based on the distance to a set of points. They are used in a variety of applications, including computer graphics, image processing, and machine learning. • By the end of this video, you will be able to understand and implement the Voronoi diagram algorithm in your own code. • • Pseudocode (short version): https://gist.github.com/isedgar/d4452... • Pseudocode (long version): https://gist.github.com/isedgar/adbf6... • JavaScript code: https://gist.github.com/isedgar/ac26c... • / edgardocpu
#############################
