Voronoi diagram: различия между версиями

Материал из WikiGrapp
Перейти к навигации Перейти к поиску
(Новая страница: «'''Voronoi diagram''' --- диаграмма Вороного. The standard ''' Voronoi diagram''' of a set of <math>n</math> given points (called sites) is a subd…»)
 
(нет различий)

Текущая версия от 14:00, 30 августа 2011

Voronoi diagram --- диаграмма Вороного.

The standard Voronoi diagram of a set of [math]\displaystyle{ n }[/math] given points (called sites) is a subdivision of the plane into regions, every one associated with each site. Each site's region consists of all points in the plane closer to it than to any of the other sites. One application that frequently occurs is what Knuth called the "post office" problem.