8 citations · 31 across the 11 of their papers we have counts for
4 papers · 1 filter
Priority Range Trees
Michael T. Goodrich, Darren Strash
We describe a data structure, called a priority range tree, which accommodates fast orthogonal range reporting queries on prioritized points. Let be a set of points in the…
Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data
David Eppstein, Michael T. Goodrich, Roberto Tamassia
We give efficient data-oblivious algorithms for several fundamental geometric problems that are relevant to geographic information systems, including planar convex hulls and all-ne…
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
Michael T. Goodrich, Michael Mitzenmacher
Suppose a client, Alice, has outsourced her data to an external storage provider, Bob, because he has capacity for her massive data set, of size n, whereas her private storage is m…
Cloning Voronoi Diagrams via Retroactive Data Structures
Matthew T. Dickerson, David Eppstein, Michael T. Goodrich
We address the problem of replicating a Voronoi diagram of a planar point set by making proximity queries, which are of three possible (in decreasing order of informatio…