31 citations · 155 across the 25 of their papers we have counts for
Showing 2008 · cs.CGShow all
2 papers · 2 filters
cs.CG2008★ 1 cited
Succinct Greedy Geometric Routing in the Euclidean Plane
Michael T. Goodrich, Darren Strash
In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to…
cs.CG2008★ 10 cited
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
David Eppstein, Michael T. Goodrich, Darren Strash
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n v…