Eunjin Oh

collaborators

3 papers

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…

cs.CG2017

The Geodesic $2$ -center Problem in a Simple Polygon

Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn

The geodesic $k$ -center problem in a simple polygon with $n$ vertices consists in the following. Find a set $S$ of $k$ points in the polygon that minimizes the maximum geodesic dis…

Finding Pairwise Intersections of Rectangles in a Query Rectangle

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

The Geodesic 2-center Problem in a Simple Polygon

The Geodesic $2$ -center Problem in a Simple Polygon