Parallelizing an Algorithm for Visibility on Polyhedral Terrain (Q4340962)
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: Parallelizing an Algorithm for Visibility on Polyhedral Terrain |
scientific article; zbMATH DE number 1022927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallelizing an Algorithm for Visibility on Polyhedral Terrain |
scientific article; zbMATH DE number 1022927 |
Statements
Parallelizing an Algorithm for Visibility on Polyhedral Terrain (English)
0 references
27 July 1997
0 references
output-sensitive sequential algorithm
0 references
best sequential complexity
0 references
0.8141906261444092
0 references
0.8098176717758179
0 references
0.773457944393158
0 references
0.7731106281280518
0 references
