Time and space efficient algorithms for shortest paths between convex polygons (Q1098634): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(88)90022-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2069500078 / rank | |||
Normal rank |
Revision as of 01:35, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Time and space efficient algorithms for shortest paths between convex polygons |
scientific article |
Statements
Time and space efficient algorithms for shortest paths between convex polygons (English)
0 references
1988
0 references
Two algorithms are presented for computing shortest paths in the plane avoiding convex polygon obstacles. For the first algorithm the obstacles are assumed to consist of f disjoint convex polygons, for the second algorithm the boundaries of 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(f n log n) and space O(n), the second algorithm preprocesses the polygons in time O(n log n\(+f\) 3) and space \(O(n+f\) 2). Thereafter one query takes time O(n log n\(+f\) 2).
0 references
computational geometry
0 references
shortest paths
0 references
convex polygon obstacles
0 references