Approximate shortest path queries using Voronoi duals

Shinichi Honiden, Michael E. Houle, Christian Sommer*, Martin Wolff

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)


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 simplification of the graph by selecting nodes independently at random with probability p. Edges are generated as the Voronoi dual of the original graph, using the selected nodes as Voronoi sites. This overlay graph allows for fast computation of approximate shortest paths for general, undirected graphs. The time-quality tradeoff decision can be made at query time. We provide bounds on the approximation ratio of the path lengths as well as experimental results. The theoretical worst-case approximation ratio is bounded by a logarithmic factor. Experiments show that our approximation method based on Voronoi duals has extremely fast preprocessing time and efficiently computes reasonably short paths.

Original languageEnglish
Title of host publicationTransactions on Computational Science IX - Special Issue on Voronoi Diagrams in Science and Engineering
Number of pages26
Publication statusPublished - 2010
Externally publishedYes
EventInternational Symposium on Voronoi Diagrams 2009 - Copenhagen, Denmark
Duration: 2009 Jun 232009 Jun 26

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6290 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


OtherInternational Symposium on Voronoi Diagrams 2009

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Approximate shortest path queries using Voronoi duals'. Together they form a unique fingerprint.

Cite this