8 citations · 8 across the 6 of their papers we have counts for
6 papers · 1 filter
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…
Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
Jack Spalding-Jamieson, Anurag Murty Naredla
Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimu…
The geodesic edge center of a simple polygon
Anna Lubiw, Anurag Murty Naredla
The geodesic edge center of a polygon is a point c inside the polygon that minimizes the maximum geodesic distance from c to any edge of the polygon, where geodesic distance is the…
Distant Representatives for Rectangles in the Plane
Therese Biedl, Anna Lubiw, Anurag Murty Naredla +2
The input to the distant representatives problem is a set of objects in the plane and the goal is to find a representative point from each object while maximizing the distance…
The Visibility Center of a Simple Polygon
Anna Lubiw, Anurag Murty Naredla
We introduce the \emph{visibility center} of a set of points inside a polygon -- a point such that the maximum geodesic distance from to see any point in the set is min…
Reconstructing a Polyhedron between Polygons in Parallel Slices
Therese Biedl, Pavle Bulatovic, Veronika Irvine +3
Given two -vertex polygons, lying in the -plane at , and lying in the -plane at , a banded surface is a triang…