|
Volumn , Issue , 1992, Pages 63-72
|
Optimal parallel algorithm for detecting weak visibility of a simple polygon
a
a
NONE
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
GEOMETRY;
POLYGONS;
PARALLEL PROCESSING SYSTEMS;
|
EID: 0026970960
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/142675.142692 Document Type: Conference Paper |
Times cited : (6)
|
References (24)
|