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 2017Show all

3 papers · 1 filter

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…

cs.CG2017

A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms

Eunjin Oh, Hee-Kap Ahn

We are given a read-only memory for input and a write-only stream for output. For a positive integer parameter s, an s-workspace algorithm is an algorithm using only $O (s)$ words o…

cs.CG2017★ 4 cited

Faster Algorithms for Growing Prioritized Disks and Rectangles

Hee-Kap Ahn, Sang Won Bae, Jongmin Choi +6

Motivated by map labeling, Funke, Krumpe, and Storandt [IWOCA 2016] introduced the following problem: we are given a sequence of $n$ disks in the plane. Initially, all disks have r…

The Geodesic 2-center Problem in a Simple Polygon

A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms

Faster Algorithms for Growing Prioritized Disks and Rectangles

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