Anonymous user
Voronoi diagram: Difference between revisions
m
add a ;Task: section header.
m (split a lone line, added whitespace before the TOC.) |
m (add a ;Task: section header.) |
||
Line 4:
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:
See algo [[K-means++ clustering]].
<br><br>
| |||