Skip to main content
Article thumbnail
Location of Repository

Reviewed by Luiz Henrique de Figueiredo References

By Lyudmil (bg-aos) Djidjev, Hristo N. (-lanl and Hua (-carl) Maheshwari

Abstract

Algorithms for approximate shortest path queries on weighted polyhedral surfaces. (English summary) Discrete Comput. Geom. 44 (2010), no. 4, 762–801. The authors consider the problem of determining shortest paths on a polyhedral surface having triangular faces with positive weights. They present query algorithms that compute approximate distances and approximate shortest paths on the surface. Given an approximation parameter ε ∈ (0, 1) and a query time parameter q, they build a data structure that can answer ε-approximate distance queries in time O(q). They also present a single-source query data structure that can answer ε-approximate distance queries from a fixed point to any query point on P in logarithmic time

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.4264
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.