z-logo
open-access-imgOpen Access
An optimal parallel algorithm for the visibility of a simple polygon from a point
Author(s) -
Mikhail J. Atallah,
Hubert Wagener,
Danny Z. Chen
Publication year - 1991
Publication title -
journal of the acm
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.672
H-Index - 134
eISSN - 1557-735X
pISSN - 0004-5411
DOI - 10.1145/116825.116827
Subject(s) - visibility , polygon (computer graphics) , citation , computer science , algorithm , simple polygon , point (geometry) , simple (philosophy) , computer graphics (images) , operations research , mathematics , library science , telecommunications , geography , monotone polygon , meteorology , geometry , philosophy , epistemology , frame (networking)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom