Theissen/Voronoi Polygons/Delaunay Triangulation

I've managed to find and implement several different approaches to these cellular like shapes but in my opinion they all share the same issue: they each draw a line between a pair of x and y coords. While visually the returned shapes are indeed polygons us Processing/P5 sketch writers know that they are not discrete shapes. Is there a method of solving a Delaunay map which returns valid shapes with vertexes in place of x,y line values?

There's an excellent write-up about the implementation here:
https://www.redblobgames.com/x/2022-voronoi-maps-tutorial/

La issue non indica file del repository, test o punti di ingresso del codice. Inizia dal tutorial collegato Red Blob Games Voronoi maps e chiarisci il deliverable previsto in Processing/p5, compreso come verrebbero verificati i vertici discreti dei poligoni e il completamento.

Scritto dal modello di indicizzazione a partire dal testo della issue.