Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms

Gill Barequet, David Eppstein, Michael T. Goodrich +1

We study algorithms and combinatorial complexity bounds for \emph{stable-matching Voronoi diagrams}, where a set, $S$, of $n$ point sites in the plane determines a stable matching…