73 citations · 634 across the 97 of their papers we have counts for
4 papers · 2 filters
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…
Drawing Trees with Perfect Angular Resolution and Polynomial Area
Christian A. Duncan, David Eppstein, Michael T. Goodrich +2
We study methods for drawing trees with perfect angular resolution, i.e., with angles at each node v equal to 2π/d(v). We show: 1. Any unordered tree has a crossing-free straight-l…
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…