 
 
 
 
 
 
 
  
 ?
?
See also 3.3.
Given a set  of
 of  distinct points in
 distinct points in  ,
Voronoi diagram is the partition of
,
Voronoi diagram is the partition of  into
 into  polyhedral regions
 polyhedral regions 
 (
 ( ).  Each region
).  Each region  ,
called the Voronoi cell of
,
called the Voronoi cell of  ,
is defined as the set of points in
,
is defined as the set of points in  which are
closer to
 which are
closer to  than to any other points in
 than to any other points in  , or more precisely,
, or more precisely,
 
 is the Euclidean distance function.  (One can
use different distance functions to define various
variations of Voronoi diagrams, but we do not
discuss them here.)
 is the Euclidean distance function.  (One can
use different distance functions to define various
variations of Voronoi diagrams, but we do not
discuss them here.)
![\includegraphics[height=40mm]{vtest_fig_vo}](img154.png) 
The set of all Voronoi cells and their faces forms a cell complex.
The vertices of this complex are called the Voronoi vertices,
and the extreme rays (i.e. unbounded edges) are  the Voronoi rays.
For each point  ,  the nearest neighbor set
,  the nearest neighbor set 
 of
 of  in
 in  is the set of points
 is the set of points  which
are closest to
 which
are closest to  in Euclidean distance.
Alternatively, one can define a point
 in Euclidean distance.
Alternatively, one can define a point  to be a Voronoi vertex of
 
to be a Voronoi vertex of  if
 if  is maximal over all nearest neighbor sets.
is maximal over all nearest neighbor sets.
In order to compute the Voronoi diagram, the following construction
is very important.  For each point  in
 in  , consider
the hyperplane tangent to the paraboloid in
, consider
the hyperplane tangent to the paraboloid in  at
 at  :
: 
 .  This hyperplane is 
represented by
.  This hyperplane is 
represented by  :
: 
 
 above for each point
 above for each point  ,
we obtain the system of
,
we obtain the system of  inequalities, which we denote by
 inequalities, which we denote by  
 .  The polyhedron
.  The polyhedron  in
 in  of all solutions
 of all solutions
 to the system of inequalities is a lifting of the Voronoi diagram
to one higher dimensional space.  In other words, by projecting
the polyhedron
 to the system of inequalities is a lifting of the Voronoi diagram
to one higher dimensional space.  In other words, by projecting
the polyhedron  onto the original
 onto the original  space, we obtain
the Voronoi diagram in the sense that the projection of each facet of
 space, we obtain
the Voronoi diagram in the sense that the projection of each facet of  associated with
associated with  is exactly the voronoi cell
 is exactly the voronoi cell  .
The vertices and the extreme rays of
.
The vertices and the extreme rays of  project exactly to
the Voronoi vertices and the rays, respectively.
 project exactly to
the Voronoi vertices and the rays, respectively.
![\includegraphics[height=40mm]{vtest_fig_vo3d}](img165.png) 
 
 
 
 
 
 
