We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...