From the 1 of 28 linked papers with an AI index.
13 papers · 1 filter
Approximation Algorithms for Geometric Maximum Coverage
Sujoy Bhore, Timothy M. Chan, Pasin Manurangsi
We study the maximum coverage problem for geometric set systems: given a set of points, a set of geometric objects, and a number , select objects maximizing the number of po…
Visibility Queries in Simple Polygons
Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla +6
Given a simple polygon with vertices, we consider the problem of constructing a data structure for visibility queries: for any query point , compute the visibility…
Dynamic Light Spanners in Doubling Metrics
Sujoy Bhore, Jonathan Conroy, Arnold Filtser
A -spanner of a point set in a metric space is a graph with vertex set such that, for any pair of points , the distance between an…
Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity
Sujoy Bhore, Sándor Kisfaludi-Bak, Lazar MilenkoviÄ +3
A Euclidean noncrossing Steiner -spanner for a point set is a planar straight-line graph that, for any two points , contains a path whose…
Dynamic and Streaming Algorithms for Union Volume Estimation
Sujoy Bhore, Karl Bringmann, Timothy M. Chan +1
The union volume estimation problem asks to -approximate the volume of the union of given objects . In their seminal wor…
On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
Sujoy Bhore, Baris Can Esmer, Daniel Marx +1
We study the Steiner Tree problem on the intersection graph of most natural families of geometric objects, e.g., disks, squares, polygons, etc. Given a set of objects in the pl…