research
∙
11/27/2022
Universal convex covering problems under translation and discrete rotations
We consider the smallest-area universal covering of planar objects of pe...
share
research
∙
03/07/2022
Farthest-point Voronoi diagrams in the presence of rectangular obstacles
We present an algorithm to compute the geodesic L_1 farthest-point Voron...
research
∙
11/03/2021
Rectangular Partitions of a Rectilinear Polygon
We investigate the problem of partitioning a rectilinear polygon P with ...
research
∙
06/27/2021
Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles
Consider two axis-aligned rectilinear simple polygons in the domain cons...
research
∙
05/06/2021
Covering Convex Polygons by Two Congruent Disks
We consider the planar two-center problem for a convex polygon: given a ...
research
∙
12/13/2020
Largest similar copies of convex polygons amidst polygonal obstacles
Given a convex polygon P with k vertices and a polygonal domain Q consis...
research
∙
07/24/2020
Largest triangles in a polygon
We study the problem of finding maximum-area triangles that can be inscr...
research
∙
06/18/2020
Efficient Planar Two-Center Algorithms
We consider the planar Euclidean two-center problem in which given n poi...
research
∙
10/27/2019
Computing a Geodesic Two-Center of Points in a Simple Polygon
Given a simple polygon P and a set Q of points contained in P, we consid...
research
∙
10/27/2019
Computing the Center Region and Its Variants
We present an O(n^2log^4 n)-time algorithm for computing the center regi...
research
∙
10/19/2019
Polygon Queries for Convex Hulls of Points
We study the following range searching problem: Preprocess a set P of n ...
research
∙
10/19/2019
Maximum-Area Rectangles in a Simple Polygon
We study the problem of finding maximum-area rectangles contained in a p...
research
∙
06/03/2019
On Romeo and Juliet Problems: Minimizing Distance-to-Sight
We introduce a variant of the watchman route problem, which we call the ...
research
∙
04/01/2018
Assigning Weights to Minimize the Covering Radius in the Plane
Given a set P of n points in the plane and a multiset W of k weights wit...
research
∙
03/12/2018
Point Location in Dynamic Planar Subdivisions
We study the point location problem on dynamic planar subdivisions that ...
research
∙
03/11/2018
Approximate Range Queries for Clustering
We study the approximate range searching for three variants of the clust...
research
∙
02/17/2018
The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon
Given a set of point sites in a simple polygon, the geodesic farthest-po...
research
∙
01/23/2018
Finding Pairwise Intersections of Rectangles in a Query Rectangle
We consider the following problem: Preprocess a set S of n axis-parallel...
research
∙
01/08/2018
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon
Given a set of sites in a simple polygon, a geodesic Voronoi diagram of ...
research
∙
10/25/2017
The Geodesic 2-center Problem in a Simple Polygon
The geodesic k-center problem in a simple polygon with n vertices consis...
research
∙
09/28/2017
