Hee-Kap Ahn

activity

20092022

collaborators

Showing 2018Show all

6 papers · 1 filter

cs.CG2018

Assigning Weights to Minimize the Covering Radius in the Plane

Eunjin Oh, Hee-Kap Ahn

Given a set $P$ of $n$ points in the plane and a multiset $W$ of $k$ weights with $k \leq n$ , we assign each weight in $W$ to a distinct point in $P$ to minimize the maximum weighte…

cs.CG2018

Point Location in Dynamic Planar Subdivisions

Eunjin Oh, Hee-Kap Ahn

We study the point location problem on dynamic planar subdivisions that allows insertions and deletions of edges. In our problem, the underlying graph of a subdivision is not neces…

cs.CG2018

Approximate Range Queries for Clustering

Eunjin Oh, Hee-Kap Ahn

We study the approximate range searching for three variants of the clustering problem with a set $P$ of $n$ points in $d$ -dimensional Euclidean space and axis-parallel rectangular…

cs.CG2018

The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon

Eunjin Oh, Luis Barba, Hee-Kap Ahn

Given a set of point sites in a simple polygon, the geodesic farthest-point Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a…

cs.CG2018

Finding Pairwise Intersections of Rectangles in a Query Rectangle

Eunjin Oh, Hee-Kap Ahn

We consider the following problem: Preprocess a set $S$ of $n$ axis-parallel boxes in $R^{d}$ so that given a query of an axis-parallel box in $R^{d}$ , the…

cs.CG2018

Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon

Eunjin Oh, Hee-Kap Ahn

Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric. We pres…