8 citations · 10 across the 5 of their papers we have counts for
6 papers
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets
Michael J. Bannister, William E. Devanny, Michael T. Goodrich +2
We study geometric data structures for sets of point-based temporal events, answering time-windowed queries, i.e., given a contiguous time interval we answer common geometric queri…
Data-Oblivious Graph Algorithms in Outsourced External Memory
Michael T. Goodrich, Joseph A. Simons
Motivated by privacy preservation for outsourced data, data-oblivious external memory is a computational framework where a client performs computations on data stored at a semi-tru…
Fixed parameter tractability of crossing minimization of almost-trees
Michael J. Bannister, David Eppstein, Joseph A. Simons
We investigate exact crossing minimization for graphs that differ from trees by a small number of additional edges, for several variants of the crossing minimization problem. In pa…
Set-Difference Range Queries
David Eppstein, Michael T. Goodrich, Joseph A. Simons
We introduce the problem of performing set-difference range queries, where answers to queries are set-theoretic symmetric differences between sets of items in two geometric ranges.…
Dynamic Planar Point Location with Sub-Logarithmic Local Updates
Maarten Löffler, Joe Simons, Darren Strash
We study planar point location in a collection of disjoint fat regions, and investigate the complexity of \emph {local updates}: replacing any region by a different region that is…
Fully Retroactive Approximate Range and Nearest Neighbor Searching
Michael T. Goodrich, Joseph A. Simons
We describe fully retroactive dynamic data structures for approximate range reporting and approximate nearest neighbor reporting. We show how to maintain, for any positive constant…