Voronoi diagram: Difference between revisions

Content added Content deleted
m (split a lone line, added whitespace before the TOC.)
m (add a ;Task: section header.)
Line 4: Line 4:
Each Voronoi site ''s'' also has a Voronoi cell consisting of all points closest to ''s''.
Each Voronoi site ''s'' also has a Voronoi cell consisting of all points closest to ''s''.



⚫
The task is to demonstrate how to generate and display a Voroni diagram.
;Task:
⚫
Demonstrate how to generate and display a Voroni diagram.


See algo [[K-means++ clustering]].
See algo [[K-means++ clustering]].
<br><br>
<br><br>
Retrieved from "https://rosettacode.org/wiki/Voronoi_diagram"