2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.CG2013★ 1 cited
On the Number of Edges of Fan-Crossing Free Graphs
Otfried Cheong, Sariel Har-Peled, Heuna Kim +1
A graph drawn in the plane with n vertices is k-fan-crossing free for k > 1 if there are no k+1 edges , such that have a common endpoint and cros…
cs.CG2011★ 2 cited
The Cost of Bounded Curvature
Hyo-Sil Kim, Otfried Cheong
We study the motion-planning problem for a car-like robot whose turning radius is bounded from below by one and which is allowed to move in the forward direction only (Dubins car).…