A simple algorithm for 2D Voronoi diagrams

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/d445248c9ff6c61cef44fc275cb2398f Pseudocode (long version): https://gist.github.com/isedgar/adbf6b035f8cce62e87998a825ba4294 JavaScript code: https://gist.github.com/isedgar/ac26c58e3eb2934623a8b8bc89611b64 https://www.instagram.com/edgardocpu/