12 citations · 65 across the 21 of their papers we have counts for
4 papers · 1 filter
Localized Geometric Query Problems
John Augustine, Sandip Das, Anil Maheshwari +3
A new class of geometric query problems are studied in this paper. We are required to preprocess a set of geometric objects in the plane, so that for any arbitrary query point…
Querying for the Largest Empty Geometric Object in a Desired Location
John Augustine, Sandip Das, Anil Maheshwari +3
We study new types of geometric query problems defined as follows: given a geometric set , preprocess it such that given a query point , the location of the largest circle th…
Largest Empty Circle Centered on a Query Line
John Augustine, Brian Putnam, Sasanka Roy
The Largest Empty Circle problem seeks the largest circle centered within the convex hull of a set of points in and devoid of points from . In this paper,…
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars
John Augustine, David Eppstein, Kevin A. Wortman
We provide an efficient reduction from the problem of querying approximate multiplicatively weighted farthest neighbors in a metric space to the unweighted problem. Combining our t…