5 citations · 8 across the 4 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CG2018★ 1 cited
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, , of point sites in the plane determines a stable matching…
cs.DS2018
Reactive Proximity Data Structures for Graphs
David Eppstein, Michael T. Goodrich, Nil Mamano
We consider data structures for graphs where we maintain a subset of the nodes called sites, and allow proximity queries, such as asking for the closest site to a query node, and u…