乐胖代购免代理版

{"id":"https://openalex.org/W2073145634","doi":"https://doi.org/10.1145/98524.98539","title":"Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)","display_name":"Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)","publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W2073145634","doi":"https://doi.org/10.1145/98524.98539","mag":"2073145634"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/98524.98539","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/98524.98539","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/98524.98539","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034971300","display_name":"Michael T. Goodrich","orcid":"https://orcid.org/0000-0002-8943-191X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael T. Goodrich","raw_affiliation_strings":["Johns Hopkins University ("],"affiliations":[{"raw_affiliation_string":"Johns Hopkins University (","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046409831","display_name":"Steven B. Shauck","orcid":null},"institutions":[{"id":"https://openalex.org/I4210159807","display_name":"Westinghouse Electric (Japan)","ror":"https://ror.org/05h40ds73","country_code":"JP","type":"company","lineage":["https://openalex.org/I4210159807","https://openalex.org/I9217761"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Steven B. Shauck","raw_affiliation_strings":["Westinghouse Electric Corporation,"],"affiliations":[{"raw_affiliation_string":"Westinghouse Electric Corporation,","institution_ids":["https://openalex.org/I4210159807"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055803695","display_name":"Sumanta Guha","orcid":"https://orcid.org/0000-0002-3522-4288"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sumanta Guha","raw_affiliation_strings":["(University of Michigan)"],"affiliations":[{"raw_affiliation_string":"(University of Michigan)","institution_ids":["https://openalex.org/I27837315"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.476,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":22,"citation_normalized_percentile":{"value":0.513661,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":87},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995,"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.9995,"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.985,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9615,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/visibility-graph","display_name":"Visibility graph","score":0.6946185},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.664532},{"id":"https://openalex.org/keywords/visibility-polygon","display_name":"Visibility polygon","score":0.54876816},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.46374685},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.44753033}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.75507796},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.7268024},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.6946185},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.664532},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.59921765},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.55359036},{"id":"https://openalex.org/C1449246","wikidata":"https://www.wikidata.org/wiki/Q7936080","display_name":"Visibility polygon","level":4,"score":0.54876816},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.48467448},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47454938},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.471257},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.46374685},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.44753033},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.41793346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3562789},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3535019},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34176442},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3165304},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.15968916},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.13789225},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/98524.98539","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/98524.98539","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/98524.98539","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/98524.98539","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":33,"referenced_works":["https://openalex.org/W1586466644","https://openalex.org/W1825136300","https://openalex.org/W1963674760","https://openalex.org/W1965327420","https://openalex.org/W1983487792","https://openalex.org/W2005314985","https://openalex.org/W2007519459","https://openalex.org/W2009530930","https://openalex.org/W2022266599","https://openalex.org/W2022754388","https://openalex.org/W2029814178","https://openalex.org/W2030999197","https://openalex.org/W2032159439","https://openalex.org/W2033609949","https://openalex.org/W2033775003","https://openalex.org/W2038699153","https://openalex.org/W2039573367","https://openalex.org/W2051161834","https://openalex.org/W2052770190","https://openalex.org/W2055982472","https://openalex.org/W2067716466","https://openalex.org/W2081280922","https://openalex.org/W2088617781","https://openalex.org/W2092472617","https://openalex.org/W2096287675","https://openalex.org/W2115636961","https://openalex.org/W2132445073","https://openalex.org/W2143462372","https://openalex.org/W2407038694","https://openalex.org/W2443862921","https://openalex.org/W4214759074","https://openalex.org/W4285719527","https://openalex.org/W4300640952"],"related_works":["https://openalex.org/W965099832","https://openalex.org/W4315798097","https://openalex.org/W4308609420","https://openalex.org/W3014595637","https://openalex.org/W2408566079","https://openalex.org/W2108250208","https://openalex.org/W2086913577","https://openalex.org/W2082318545","https://openalex.org/W2066813664","https://openalex.org/W194375378"],"abstract_inverted_index":{"In":[0],"this":[1,60],"paper":[2],"we":[3,52,113],"give":[4],"efficient":[5,64],"parallel":[6,65],"algorithms":[7,22],"for":[8,18,40,67,105],"solving":[9],"a":[10,36,47,97],"number":[11,88],"of":[12,35,71,80,83,89,99],"visibility":[13,70,78],"and":[14,29,101],"shortest":[15,44,93],"path":[16,94],"problems":[17],"simple":[19,48],"polygons.":[20],"Our":[21],"all":[23,43],"run":[24],"in":[25,46,108],"\u039f(log":[26],"n)":[27],"time":[28],"are":[30],"based":[31],"on":[32],"the":[33,54,69,77,81,92,106,116],"use":[34,59,114],"new":[37],"data":[38],"structure":[39],"implicitly":[41],"representing":[42],"paths":[45],"polygon":[49],"P,":[50,100],"which":[51],"call":[53],"stratified":[55],"decomposition":[56],"tree.":[57],"We":[58],"approach":[61],"to":[62],"derive":[63],"methods":[66],"computing":[68],"P":[72,84],"from":[73,96],"an":[74,86],"edge,":[75],"constructing":[76,91],"graph":[79],"vertices":[82,107],"(using":[85],"output-sensitive":[87],"processors),":[90],"tree":[95],"vertex":[98],"determining":[102],"all-farthest":[103],"neighbors":[104],"P.":[109],"The":[110],"computational":[111],"model":[112],"is":[115],"CREW":[117],"PRAM.":[118]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2073145634","counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2024-12-12T17:47:37.011777","created_date":"2016-06-24"}