Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 98406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel methods for visibility and shortest-path problems in simple polygons |
scientific article; zbMATH DE number 98406 |
Statements
Parallel methods for visibility and shortest-path problems in simple polygons (English)
0 references
17 January 1993
0 references
Visibility problems for simple polygons are intensively studied in computational geometry, usually by means of visibility graphs and shortest-paths trees. The authors introduce a new data structure called stratified decomposition tree which allows to answer effectively shortes path queries in a simple polygon. This is a main tool for deriving a number of parallel algorithms, all running in \(O(\log n)\) time on CREW PRAM. This is an improvement over \(O(\log^ 2n)\) existing algorithms.
0 references
computational geometry
0 references
visibility
0 references
polygons
0 references
parallel algorithms
0 references
0 references
0.8645695447921753
0 references
0.8415982127189636
0 references
0.8307182192802429
0 references
0.8256385326385498
0 references
0.8164074420928955
0 references
