Chaeyoon Chung

collaborators

2 papers

cs.CG2026

Linear-Time $(1 + ε)$ -Approximation Algorithms for Two-Line-Center Problems

Chaeyoon Chung, Anil Maheshwari, Michiel Smid

Given a set $S$ of $n$ points in the plane, we study the two-line-center problem: finding two lines that minimize the maximum distance from each point in $S$ to its closest line. W…

cs.CG2025

Closest Pair Queries in Vertical Slabs and Tight Bounds on the Number of Possible Answers

Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung +6

Let $S$ be a set of $n$ points in $R^{d}$ , where $d \geq 2$ is a constant, and let $H_{1}, H_{2}, \dots, H_{m + 1}$ be a sequence of vertical hyperplanes that are sorted by their fi…

Linear-Time (1+ε)-Approximation Algorithms for Two-Line-Center Problems

Closest Pair Queries in Vertical Slabs and Tight Bounds on the Number of Possible Answers

Linear-Time $(1 + ε)$ -Approximation Algorithms for Two-Line-Center Problems