Optimal parallel algorithm for visibility of a simple polygon from a point

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: M. J. Atallah Purdue University
D. Z. Chen Purdue University
Published in:
· Proceeding
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Pages 114 - 123
ACM New York, NY, USA ©1989
table of contents ISBN:0-89791-318-3 doi>10.1145/73833.73846
Optimal parallel algorithm for visibility of a simple polygon from a point Published by ACM 1989 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 9
· Downloads (cumulative): 230
· Citation Count: 3


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder