A Voronoi diagram is a diagram consisting of a number of sites.

Each Voronoi site s also has a Voronoi cell consisting of all points closest to s.



Task

Demonstrate how to generate and display a Voroni diagram.



See algo K-means++ clustering.




0	П4
	0	П5
		ИП0	1	-	x^2	ИП1	1	-	x^2	+	КвКор	П3
		9	П6
			КИП6	П8	{x}	2	10^x	*	П9
			[x]	ИП5	-	x^2	ИП9	{x}	2	10^x	*	ИП4	-	x^2	+	КвКор	П9
			ИП3	-	x<0	47	ИП9	П3	ИП6	П7
		ИП6	ИП2	-	9	-	x>=0	17
		КИП7	[x]	С/П
	КИП5	ИП5	ИП1	-	x>=0	04
КИП4	ИП4	ИП0	-	x>=0	02