23 citations · 47 across the 15 of their papers we have counts for
Showing 2009 · cs.CGShow all
2 papers · 2 filters
cs.CG2009★ 1 cited
Querying Two Boundary Points for Shortest Paths in a Polygonal Domain
Sang Won Bae, Yoshio Okamoto
We consider a variant of two-point Euclidean shortest path query problem: given a polygonal domain, build a data structure for two-point shortest path query, provided that query po…
cs.CG2009
Covering Points by Disjoint Boxes with Outliers
Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine +5
For a set of n points in the plane, we consider the axis--aligned (p,k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain n-k points. In this…