As mentioned in Section , a stable-matching Voronoi diagram can be viewed as the lower envelope of a set of cones.
Sharir and Agarwal [1]} provide results that characterize the combinatorial complexity of the lower envelope of certain sets of functions, including cones.
