Showing 2025Show all
2 papers · 1 filter
cs.CG2025
Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness
David Eppstein, Michael T. Goodrich, Abraham M. Illickan +1
We study entropy-bounded computational geometry, that is, geometric algorithms whose running times depend on a given measure of the input entropy. Specifically, we introduce a meas…
cs.DS2025
Fast Geographic Routing in Fixed-Growth Graphs
Ofek Gila, Michael T. Goodrich, Abraham M. Illickan +1
In the 1960s, the social scientist Stanley Milgram performed his famous "small-world" experiments where he found that people in the US who are far apart geographically are neverthe…