Shortest paths in the plane with convex polygonal obstacles (Q1085615)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Shortest paths in the plane with convex polygonal obstacles |
scientific article; zbMATH DE number 3982536
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest paths in the plane with convex polygonal obstacles |
scientific article; zbMATH DE number 3982536 |
Statements
Shortest paths in the plane with convex polygonal obstacles (English)
0 references
1986
0 references
An algorithm is presented which computes shortest paths in the Euclidean plane that do not cross given obstacles. The set of obstacles is assumed to consist of f disjoint convex polygons with n vertices in total. After preprocessing time \(O(n+f^ 2\log n)\), the shortest path between two arbitrary query points can be found in \(O(f^ 2+n \log n)\) time. The space complexity is \(O(n+f^ 2)\).
0 references
convex polygonal obstacles
0 references
computational geometry
0 references
