83 citations · 606 across the 54 of their papers we have counts for
3 papers · 2 filters
Memoryless Routing in Convex Subdivisions: Random Walks are Optimal
Dan Chen, Luc Devroye, Vida Dujmovic +1
A memoryless routing algorithm is one in which the decision about the next edge on the route to a vertex t for a packet currently located at vertex v is made based only on the coor…
Minimum feature size preserving decompositions
Greg Aloupis, Erik D. Demaine, Martin L. Demaine +2
The minimum feature size of a crossing-free straight line drawing is the minimum distance between a vertex and a non-incident edge. This quantity measures the resolution needed to…
Entropy, Triangulation, and Point Location in Planar Subdivisions
Sebastien Collette, Vida Dujmovic, John Iacono +2
A data structure is presented for point location in connected planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query tim…