4 citations · 4 across the 2 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2023
Approximate Distance and Shortest-Path Oracles for Fault-Tolerant Geometric Spanners
Kyungjin Cho, Jihun Shin, Eunjin Oh
In this paper, we present approximate distance and shortest-path oracles for fault-tolerant Euclidean spanners motivated by the routing problem in real-world road networks. An -…
cs.CG2023
Faster Algorithms for Cycle Hitting Problems on Disk Graphs
Shinwoo An, Kyungjin Cho, Eunjin Oh
In this paper, we consider three hitting problems on a disk intersection graph: Triangle Hitting Set, Feedback Vertex Set, and Odd Cycle Transversal. Given a disk intersection grap…
cs.CG2015★ 4 cited
A linear-time algorithm for the geodesic center of a simple polygon
Hee-Kap Ahn, Luis Barba, Prosenjit Bose +3
Given two points in a simple polygon of vertices, its geodesic distance is the length of the shortest path that connects them among all paths that stay within . The geod…