Eunku Park

activity

20242026

collaborators

Showing 2026Show all

4 papers · 1 filter

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

We study nearest and farthest Voronoi diagrams of lines in $R^{3}$ under the Euclidean metric when all $n$ lines belong to one ruling of a smooth doubly ruled real quadric.…

cs.CG2026

Coresets for Continuous $k$ -Center in Hyperbolic Space

Eunku Park

We study the continuous $k$ -center problem in fixed-dimensional hyperbolic space. The input is a finite point set $P \subset H^{D}$ , while the centers may be placed anywhere…

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}$