Hee-Kap Ahn

activity

20092022

collaborators

Showing 2019Show all

5 papers · 1 filter

cs.CG2019

Computing a Geodesic Two-Center of Points in a Simple Polygon

Eunjin Oh, Sang Won Bae, Hee-Kap Ahn

Given a simple polygon $P$ and a set $Q$ of points contained in $P$ , we consider the geodesic $k$ -center problem where we want to find $k$ points, called \emph{centers}, in $P$ to…

cs.CG2019

Computing the Center Region and Its Variants

Eunjin Oh, Hee-Kap Ahn

We present an $O (n^{2} lo g^{4} n)$ -time algorithm for computing the center region of a set of $n$ points in the three-dimensional Euclidean space. This improves the previously best kno…

cs.CG2019

Polygon Queries for Convex Hulls of Points

Eunjin Oh, Hee-Kap Ahn

We study the following range searching problem: Preprocess a set $P$ of $n$ points in the plane with respect to a set $O$ of $k$ orientations % , for a constant, in the p…

cs.CG2019

Maximum-Area Rectangles in a Simple Polygon

Yujin Choi, Seungjun Lee, Hee-Kap Ahn

We study the problem of finding maximum-area rectangles contained in a polygon in the plane. There has been a fair amount of work for this problem when the rectangles have to be ax…

cs.CG2019

On Romeo and Juliet Problems: Minimizing Distance-to-Sight

Hee-Kap Ahn, Eunjin Oh, Lena Schlipf +2

We introduce a variant of the watchman route problem, which we call the quickest pair-visibility problem. Given two persons standing at points $s$ and $t$ in a simple polygon $P$ w…