ries execution. It is closely related with the
other
computational geometry concepts: Delaunay triangulation, medial axis,
straight skeleton, the largest empty circle. The Boost.Polygon library
provides interface to construct Voronoi diagram of points figure a and
line segments figure b (the last could be used to discretize any
two-dimensional curve). Figure c contains the example of the medial
axis of the
non-convex polygon. The implementation <a href="voronoi_benchmark.htm">outperforms</a>
most of the kno