An optimal parallel algorithm for the visibility of a simple polygon from a point
Mikhail J. Atallah, Hubert Wagener, Danny Z. Chen · Journal of the ACM · 1991
article Free Access Share on An optimal parallel algorithm for the visibility of a simple polygon from a point Authors: Mikhail J. Atallah Purdue Univ., West Lafayette, IN Purdue Univ., West Lafayette, INView Profile , Hubert Wagener Technische Univ., Berlin, Germany Technische Univ., Berlin, GermanyView Profile , Danny Z. Chen Purdue Univ., West Lafayette, IN Purdue Univ., West Lafayette, INView Profile Authors Info & Claims Journal of the ACMVolume 38Issue 3July 1991 pp 515–532https://doi.org/10.1145/116825.116827Published:01 July 1991Publication History 19citation554DownloadsMetricsTotal Citations19Total Downloads554Last 12 Months13Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF