Please use this identifier to cite or link to this item:
doi:10.22028/D291-26128
Title: | New algorithms for shortest paths avoiding convex polygonal obstacles |
Author(s): | Rohnert, Hans |
Language: | English |
Year of Publication: | 1986 |
OPUS Source: | Kaiserslautern ; Saarbrücken : DFKI, 1986 |
Free key words: | computational geometry |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | Two algorithms are presented for computing shortest paths in the plane avoiding convex polygonal obstacles. For the first algorithm the obstacles are assumed to consist of f disjoint convex polygons, for the second algorithm the f polygons may intersect pairwise at most twice. For finding the shortest path between two arbitrary query points the first algorithm takes time O(nlogn + f^2logn) and space O(n), the second algorithm preprocesses the polygons in time O(nlogn + f^3) and space O(n + f^2). Thereafter one query takes time O(nlogn + f^2). |
Link to this record: | urn:nbn:de:bsz:291-scidok-41955 hdl:20.500.11880/26184 http://dx.doi.org/10.22028/D291-26128 |
Series name: | Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes |
Series volume: | 1986/02 |
Date of registration: | 6-Sep-2011 |
Faculty: | MI - Fakultät für Mathematik und Informatik |
Department: | MI - Informatik |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
File | Description | Size | Format | |
---|---|---|---|---|
fb14_1986_02.pdf | 3,64 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.