Eunku Park

activity

20242026

collaborators

Showing 2026 · cs.CGShow all

4 papers · 2 filters

cs.CG2026

Optimal Coresets for Hyperbolic Farthest-Point Queries via Ideal-Boundary Envelopes

Eunku Park

We study coresets for farthest-point queries in hyperbolic space. Given a nonempty finite set $P \subset H^{D}$ and $0 < ε \leq 1$ , we seek a coreset $P_{\varepsilon}…

cs.CG2026

Quadratic Complexity of Voronoi Diagrams in $R^{3}$ for Lines in a Single Ruling of a Regulus

Eunku Park, Kangjin Han

We study nearest and farthest Voronoi diagrams of lines in three-dimensional Euclidean space, which partition space according to the closest and farthest input lines, respectively.…

cs.CG2026

Coresets for Continuous $k$ -Center in Hyperbolic Space

Eunku Park

We study coresets for the continuous $k$ -center problem in fixed-dimensional hyperbolic space $H^{D}$ , where centers may lie anywhere in the space. For an input set $P$ of $n…

cs.CG2026

Computing Topological Transition Sets for Line-Line-Circle Trisectors in $R^{3}$

Eunku Park

Computing the Voronoi diagram of mixed geometric objects in $R^{3}$ is challenging due to the high cost of exact geometric predicates via Cylindrical Algebraic Decomposition (CAD). W…

Optimal Coresets for Hyperbolic Farthest-Point Queries via Ideal-Boundary Envelopes

Quadratic Complexity of Voronoi Diagrams in R3 for Lines in a Single Ruling of a Regulus

Coresets for Continuous k-Center in Hyperbolic Space

Computing Topological Transition Sets for Line-Line-Circle Trisectors in R3

Quadratic Complexity of Voronoi Diagrams in $R^{3}$ for Lines in a Single Ruling of a Regulus

Coresets for Continuous $k$ -Center in Hyperbolic Space

Computing Topological Transition Sets for Line-Line-Circle Trisectors in $R^{3}$