Eunjin Oh

collaborators

Showing cs.CGShow all

3 papers · 1 filter

cs.CG2026

Fully Scalable MPC Algorithms for WSPD in Doubling and Euclidean Spaces

Eunjin Oh, Hyeonjun Shin

In this paper, we study the problem of constructing a $(1/ ε)$ -well-separated pair decomposition (WSPD) for a point set of size $n$ in the Massively Parallel Computation (…

cs.CG2026

Touring a Sequence of Orthogonal Polygons

Katrin Casel, SÃ¡ndor Kisfaludi-Bak, Linda Kleist +3

We study the problem of computing a shortest tour that visits a sequence of $k$ polygons $P_{1}, \dots, P_{k}$ with a total number of $n$ vertices. A tour is an oriented curve such that…

cs.CG2026

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates

Seongbin Park, Eunjin Oh

In this paper, we study the many-to-many matching problem on planar point sets with integer coordinates: Given two disjoint sets $R, B \subset [I^]^{2}$ with $∣ R ∣ + ∣ B ∣ = n$ , the goal is…