{"id":"https://openalex.org/W2039041757","doi":"https://doi.org/10.1002/scj.4690240101","title":"An optimal parallel algorithm for finding shortest paths inside simple polygons","display_name":"An optimal parallel algorithm for finding shortest paths inside simple polygons","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2039041757","doi":"https://doi.org/10.1002/scj.4690240101","mag":"2039041757"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690240101","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5100344522","display_name":"Wei Chen","orcid":"https://orcid.org/0000-0003-0065-3610"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Wei Chen","raw_affiliation_strings":["Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","Wei Chen received a B.S. and an M.E. from Shanghai Marine Institute, China, in 1982 and Osaka University, Japan, in 1991, respectively. She is now in the doctoral program in the Department of Information and Computer Sciences, Osaka University. Her research interests are parallel computation and computational geometry. She is a member of IPS of Japan"],"affiliations":[{"raw_affiliation_string":"Wei Chen received a B.S. and an M.E. from Shanghai Marine Institute, China, in 1982 and Osaka University, Japan, in 1991, respectively. She is now in the doctoral program in the Department of Information and Computer Sciences, Osaka University. Her research interests are parallel computation and computational geometry. She is a member of IPS of Japan","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086055038","display_name":"Koji Nakano","orcid":"https://orcid.org/0000-0002-2040-4032"},"institutions":[{"id":"https://openalex.org/I65143321","display_name":"Hitachi (Japan)","ror":"https://ror.org/02exqgm79","country_code":"JP","type":"company","lineage":["https://openalex.org/I65143321"]},{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Koji Nakano","raw_affiliation_strings":["Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","IPS of Japan","Koji Nakano received a Dr. of Eng. degree from Osaka University in 1992. Since 1992, he has been a Researcher at the Advanced Research Laboratory, Hitachi, Ltd. His interests include parallel and distributed algorithms, graph theory, and computational complexity. He is a member of IEEE"],"affiliations":[{"raw_affiliation_string":"Koji Nakano received a Dr. of Eng. degree from Osaka University in 1992. Since 1992, he has been a Researcher at the Advanced Research Laboratory, Hitachi, Ltd. His interests include parallel and distributed algorithms, graph theory, and computational complexity. He is a member of IEEE","institution_ids":["https://openalex.org/I65143321"]},{"raw_affiliation_string":"IPS of Japan","institution_ids":[]},{"raw_affiliation_string":"Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075313331","display_name":"Toshimitsu Masuzawa","orcid":"https://orcid.org/0000-0003-4628-6393"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshimitsu Masuzawa","raw_affiliation_strings":["Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","Toshimitsu Masuzawa received a B.E., an M.E., and a Dr. of Eng. from Osaka University, Japan, in 1982, 1984, and 1987, respectively. He is an Assistant Professor in the Department of Information and Computer Sciences. His research interests include distributed algorithms, parallel algorithm, and graph theory. He is a member of IPS of Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Toshimitsu Masuzawa received a B.E., an M.E., and a Dr. of Eng. from Osaka University, Japan, in 1982, 1984, and 1987, respectively. He is an Assistant Professor in the Department of Information and Computer Sciences. His research interests include distributed algorithms, parallel algorithm, and graph theory. He is a member of IPS of Japan","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113541231","display_name":"Yoshihiro Tsujino","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoshihiro Tsujino","raw_affiliation_strings":["Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","Yoshihiro Tsqjino received a B.E., an M.E., and a Dr. of Eng. degree from Osaka University, Japan, in 1979, 1981, and 1984, respectively. He is an Associate Professor in the Department of Information and Computer Sciences, Osaka University. His research interests include programming languages, parallel processing, programming education, and user interfaces. He is a member of the IPS of Japan."],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Yoshihiro Tsqjino received a B.E., an M.E., and a Dr. of Eng. degree from Osaka University, Japan, in 1979, 1981, and 1984, respectively. He is an Associate Professor in the Department of Information and Computer Sciences, Osaka University. His research interests include programming languages, parallel processing, programming education, and user interfaces. He is a member of the IPS of Japan.","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112263709","display_name":"Nobuki Tokura","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]},{"id":"https://openalex.org/I1321014770","display_name":"Association for Computing Machinery","ror":"https://ror.org/03wsadn68","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1321014770"]}],"countries":["JP","US"],"is_corresponding":false,"raw_author_name":"Nobuki Tokura","raw_affiliation_strings":["Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","IPS of Japan","Japan Society for Software Science and Technology","Japan Society of Artificial Intelligence.","Nobuki Tokura received a B.E., an M.E., and a Dr. of Eng. degree from Osaka University, Japan, in 1963, 1965, and 1968, respectively. He is a Professor in the Department of Information and Computer Sciences, Osaka University. His research interests include programming technique and theory, computer languages, and computational complexity theory of VLSI. He is a member of the Association for Computing Machinery"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Nobuki Tokura received a B.E., an M.E., and a Dr. of Eng. degree from Osaka University, Japan, in 1963, 1965, and 1968, respectively. He is a Professor in the Department of Information and Computer Sciences, Osaka University. His research interests include programming technique and theory, computer languages, and computational complexity theory of VLSI. He is a member of the Association for Computing Machinery","institution_ids":["https://openalex.org/I98285908","https://openalex.org/I1321014770"]},{"raw_affiliation_string":"IPS of Japan","institution_ids":[]},{"raw_affiliation_string":"Japan Society for Software Science and Technology","institution_ids":[]},{"raw_affiliation_string":"Japan Society of Artificial Intelligence.","institution_ids":[]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":53},"biblio":{"volume":"24","issue":"1","first_page":"1","last_page":"15"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998,"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.9998,"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.9961,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9885,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4684287},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.466909},{"id":"https://openalex.org/keywords/simple-algorithm","display_name":"SIMPLE algorithm","score":0.42751575}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6325788},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.601607},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.58127034},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5765983},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.56329775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.56291014},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.55294806},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.53375274},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.51986957},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.50207067},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.49849153},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.48507205},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4684287},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.466909},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46564066},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.44800478},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.44107506},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4383982},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.42751575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38303465},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.28943172},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.16442117},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0674102},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690240101","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":12,"referenced_works":["https://openalex.org/W1586466644","https://openalex.org/W1612751597","https://openalex.org/W2003583528","https://openalex.org/W2009530930","https://openalex.org/W2016482138","https://openalex.org/W2022754388","https://openalex.org/W2038699153","https://openalex.org/W2047596954","https://openalex.org/W2052770190","https://openalex.org/W2115636961","https://openalex.org/W2463535492","https://openalex.org/W4299935650"],"related_works":["https://openalex.org/W651485002","https://openalex.org/W4293054712","https://openalex.org/W2597144308","https://openalex.org/W2391130892","https://openalex.org/W2360981904","https://openalex.org/W2358661218","https://openalex.org/W2354846196","https://openalex.org/W2352589493","https://openalex.org/W2348287729","https://openalex.org/W2136320479"],"abstract_inverted_index":{"Abstract":[0],"Given":[1],"a":[2,5,13,19,29],"triangulation":[3],"of":[4,74,77],"simple":[6],"n":[7,46,52,54,70],"\u2010gon":[8],"P":[9,17],"and":[10,14,30,56],"two":[11],"points":[12],"b":[15,31],"inside":[16,37],",":[18],"parallel":[20],"algorithm":[21,40],"is":[22,58],"presented":[23],"for":[24],"determining":[25],"the":[26,33,61,64,78],"path":[27],"between":[28],"with":[32,51,68],"shortest":[34],"Euclidean":[35],"distance":[36],"P.":[38],"The":[39],"has":[41],"time":[42,75],"complexity":[43,76],"O":[44],"(log":[45],")":[47],"on":[48],"CREW":[49],"PRAM":[50],"/log":[53],"processors":[55],"thus":[57],"optimal":[59],"in":[60],"sense":[62],"that":[63],"time\u2010processor":[65],"product":[66],"agrees":[67],"\u03a9(":[69],")\u2014the":[71],"lower":[72],"bound":[73],"sequential":[79],"algorithms.":[80]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2039041757","counts_by_year":[],"updated_date":"2024-12-09T08:13:11.806494","created_date":"2016-06-24"}