4
$\begingroup$

I am looking for a term used to describe an analog to Voronoi diagrams where instead of a single point defining a cell, a continuous set of points is used. For example, starting with five triangles on the plane, you could construct a diagram that contained regions where each point in that region would be closer to a certain triangle than any other triangle.

Is anyone aware of any papers dealing with this type of construction? I'm having a hard time searching for any since I don't know if there is a name for it.

3 Answers 3

5

Here is one reference, to the CGAL manual section explaining its computation of the Voronoi diagram of segments, e.g.:
SegVorDiag

4

It's still called a Voronoi diagram.

1

The original paper for Fortune's algorithm for constructing Voronoi diagrams deals with the case of line segment sites (Section 3).