Eunjin Oh

activity

20152023

most citedA linear-time algorithm for the geodesic center of a simple polygon

4 citations · 9 across the 11 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

cs.CG2021

Feedback Vertex Set on Geometric Intersection Graphs

Shinwoo An, Eunjin Oh

In this paper, we present an algorithm for computing a feedback vertex set of a unit disk graph of size $k$ , if it exists, which runs in time $2^{O (k)} (n + m)$ , where $n$ and…

cs.CG2021

Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces

Kyungjin Cho, Eunjin Oh

In this paper, we present a linear-time approximation scheme for $k$ -means clustering of \emph{incomplete} data points in $d$ -dimensional Euclidean space. An \emph{incomplete} data…

cs.CG2021

Reachability Problems for Transmission Graphs

Shinwoo An, Eunjin Oh

Let $P$ be a set of $n$ points in the plane where each point $p$ of $P$ is associated with a radius $r_{p} > 0$ .The transmission graph $G = (P, E)$ of $P$ is defined as the directed graph…