An optimal parallel algorithm for the visibility of a simple polygon from a point (Q4302845)
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 622325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal parallel algorithm for the visibility of a simple polygon from a point |
scientific article; zbMATH DE number 622325 |
Statements
An optimal parallel algorithm for the visibility of a simple polygon from a point (English)
0 references
29 September 1994
0 references
computational geometry
0 references
simple polygons
0 references
visible regions
0 references
intersections of polygonal chains
0 references
parallel computational complexity
0 references
0.8935738801956177
0 references
0.8810075521469116
0 references
0.8331527709960938
0 references
