Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ALGORITHMICA

2011

2011

Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which connects s to t such that the leg between any two consecutive points in the set is at most L. The minimal path among all these paths is the L-bounded leg shortest path from s to t. In the s-t Bounded Leg Shortest Path (stBLSP) problem we are given two points s and t and a real number L, and are required to compute an Lbounded leg shortest path from s to t. In the All-Pairs Bounded Leg Shortest Path (apBLSP) problem we are required to build a data structure that, given any two query points from V and any real number L, outputs the length of the L-bounded leg shortest path (a distance query) or the path itself (a path query). In this paper present ﬁrst an algorithm for the apBLSP problem in any lp-metric which, for any ﬁxed ε > 0, computes in O(n3 (log3 n + log2 n · ε−d )) time a data structure which app...

Related Content

Added |
12 May 2011 |

Updated |
12 May 2011 |

Type |
Journal |

Year |
2011 |

Where |
ALGORITHMICA |

Authors |
Liam Roditty, Michael Segal |

Comments (0)