{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T09:04:53Z","timestamp":1759482293214},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01n02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[1997,2]]},"abstract":"<jats:p> The best known output-sensitive sequential algorithm for computing the viewshed on a polyhedral terrain from a given viewpoint was proposed by Katz, Overmars, and Sharir,<jats:sup>10<\/jats:sup> and achieves time complexity O((k + n\u03b1(n)) log n) where n and k are the input and output sizes respectively, and \u03b1() is the inverse Ackermann's function. In this paper, we present a parallel algorithm that is based on the work mentioned above, and achieves O( log <jats:sup>2<\/jats:sup>n) time complexity, with work complexity O((k + n\u03b1(n)) log n) in a CREW PRAM model. This improves on previous parallel complexity while maintaining work efficiency with respect to the best sequential complexity known. <\/jats:p>","DOI":"10.1142\/s0218195997000065","type":"journal-article","created":{"date-parts":[[2003,10,16]],"date-time":"2003-10-16T10:47:26Z","timestamp":1066301246000},"page":"75-84","source":"Crossref","is-referenced-by-count":2,"title":["Parallelizing an Algorithm for Visibility on Polyhedral Terrain"],"prefix":"10.1142","volume":"07","author":[{"given":"Y. Ansel","family":"Teng","sequence":"first","affiliation":[{"name":"Center for Automation Research, University of Maryland, College Park, MD 20742, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Mount","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Maryland, College Park, MD 20742, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Puppo","sequence":"additional","affiliation":[{"name":"Istituto per la Matematica Applicata, Consiglio Nazionale delle Ricerche, Via De Marini, 6 (Torre di Francia), Genova 16149, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry S.","family":"Davis","sequence":"additional","affiliation":[{"name":"University of Maryland Institute for Advanced Computer Studies, College Park, MD 20742, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195997000065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:31:01Z","timestamp":1565137861000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195997000065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":0,"journal-issue":{"issue":"01n02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1997,2]]}},"alternative-id":["10.1142\/S0218195997000065"],"URL":"https:\/\/doi.org\/10.1142\/s0218195997000065","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}