{"id":"https://openalex.org/W2143503070","doi":"https://doi.org/10.1142/s0218195997000065","title":"Parallelizing an Algorithm for Visibility on Polyhedral Terrain","display_name":"Parallelizing an Algorithm for Visibility on Polyhedral Terrain","publication_year":1997,"publication_date":"1997-02-01","ids":{"openalex":"https://openalex.org/W2143503070","doi":"https://doi.org/10.1142/s0218195997000065","mag":"2143503070"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195997000065","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195997000065","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090438869","display_name":"Yuan\u2010Hsiang Teng","orcid":"https://orcid.org/0000-0002-8287-5913"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Y. Ansel Teng","raw_affiliation_strings":["Center for Automation Research, University of Maryland, College Park, MD 20742, USA","Center for Automation Research, University of Maryland, College Park, MD, 20742, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Automation Research, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Center for Automation Research, University of Maryland, College Park, MD, 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016442699","display_name":"David M. Mount","orcid":"https://orcid.org/0000-0002-3290-8932"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Mount","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD 20742, USA","Department of Computer Science, University of Maryland, College Park, MD 20742 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD 20742 USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018876607","display_name":"Enrico Puppo","orcid":"https://orcid.org/0000-0001-9780-5283"},"institutions":[{"id":"https://openalex.org/I4210137033","display_name":"Istituto di Matematica Applicata e Tecnologie Informatiche","ror":"https://ror.org/03m0n3c07","country_code":"IT","type":"education","lineage":["https://openalex.org/I4210137033","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Enrico Puppo","raw_affiliation_strings":["Istituto per la Matematica Applicata, Consiglio Nazionale delle Ricerche, Via De Marini, 6 (Torre di Francia), Genova 16149, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Istituto per la Matematica Applicata, Consiglio Nazionale delle Ricerche, Via De Marini, 6 (Torre di Francia), Genova 16149, Italy","institution_ids":["https://openalex.org/I4210137033"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111454036","display_name":"Larry S. Davis","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Larry S. Davis","raw_affiliation_strings":["University of Maryland Institute for Advanced Computer Studies, College Park, MD 20742, USA","University of Maryland Institute for Advanced Computer Studies, College Park, MD 20742, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland Institute for Advanced Computer Studies, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"University of Maryland Institute for Advanced Computer Studies, College Park, MD 20742, USA#TAB#","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.22966242,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"07","issue":"01n02","first_page":"75","last_page":"84"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.9137511253356934},{"id":"https://openalex.org/keywords/viewshed-analysis","display_name":"Viewshed analysis","score":0.7003368735313416},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6601712703704834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6118330359458923},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6067119240760803},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.5799945592880249},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.5647770166397095},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5617830753326416},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5081346035003662},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4948083758354187},{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.4919690787792206},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.432075560092926},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4179248809814453},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3574579954147339}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.9137511253356934},{"id":"https://openalex.org/C24300010","wikidata":"https://www.wikidata.org/wiki/Q7928833","display_name":"Viewshed analysis","level":2,"score":0.7003368735313416},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6601712703704834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6118330359458923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6067119240760803},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.5799945592880249},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.5647770166397095},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5617830753326416},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5081346035003662},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4948083758354187},{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.4919690787792206},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.432075560092926},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4179248809814453},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3574579954147339},{"id":"https://openalex.org/C62649853","wikidata":"https://www.wikidata.org/wiki/Q199687","display_name":"Remote sensing","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0218195997000065","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195997000065","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.2843","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.2843","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.disi.unige.it/ftp/person/PuppoE/PS/ijcga94.ps.Z","raw_type":"text"},{"id":"pmh:oai:iris.unige.it:11567/1106445","is_oa":false,"landing_page_url":"https://hdl.handle.net/11567/1106445","pdf_url":null,"source":{"id":"https://openalex.org/S4377196291","display_name":"CINECA IRIS Institutial Research Information System (University of Genoa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83816512","host_organization_name":"University of Genoa","host_organization_lineage":["https://openalex.org/I83816512"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1978583881","https://openalex.org/W1978600082","https://openalex.org/W2027679733","https://openalex.org/W2063027901","https://openalex.org/W2068720912","https://openalex.org/W2074456731","https://openalex.org/W2172144276"],"related_works":["https://openalex.org/W2092901467","https://openalex.org/W2295219817","https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W2055625272"],"abstract_inverted_index":{"The":[0],"best":[1,104],"known":[2],"output-sensitive":[3],"sequential":[4,105],"algorithm":[5,60],"for":[6],"computing":[7],"the":[8,40,49,65,103],"viewshed":[9],"on":[10,64,92],"a":[11,15,58,86],"polyhedral":[12],"terrain":[13],"from":[14],"given":[16],"viewpoint":[17],"was":[18],"proposed":[19],"by":[20],"Katz,":[21],"Overmars,":[22],"and":[23,26,37,42,46,69],"Sharir,":[24],"10":[25],"achieves":[27,70],"time":[28,75],"complexity":[29,79,95,106],"O((k":[30,80],"+":[31,81],"n\u03b1(n))":[32,82],"log":[33,72,83],"n)":[34,74,84],"where":[35],"n":[36],"k":[38],"are":[39],"input":[41],"output":[43],"sizes":[44],"respectively,":[45],"\u03b1()":[47],"is":[48,62],"inverse":[50],"Ackermann's":[51],"function.":[52],"In":[53],"this":[54],"paper,":[55],"we":[56],"present":[57],"parallel":[59,94],"that":[61],"based":[63],"work":[66,78,98],"mentioned":[67],"above,":[68],"O(":[71],"2":[73],"complexity,":[76],"with":[77,100],"in":[85],"CREW":[87],"PRAM":[88],"model.":[89],"This":[90],"improves":[91],"previous":[93],"while":[96],"maintaining":[97],"efficiency":[99],"respect":[101],"to":[102],"known.":[107]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}