{"id":"https://openalex.org/W2057025928","doi":"https://doi.org/10.1016/s0020-0190(03)00284-9","title":"Finding shortest safari routes in simple polygons","display_name":"Finding shortest safari routes in simple polygons","publication_year":2003,"publication_date":"2003-06-09","ids":{"openalex":"https://openalex.org/W2057025928","doi":"https://doi.org/10.1016/s0020-0190(03)00284-9","mag":"2057025928"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(03)00284-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(03)00284-9","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5023193789","display_name":"Xuehou Tan","orcid":"https://orcid.org/0000-0002-9828-9927"},"institutions":[{"id":"https://openalex.org/I1314466530","display_name":"Tokai University","ror":"https://ror.org/01p7qe739","country_code":"JP","type":"education","lineage":["https://openalex.org/I1314466530"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Xuehou Tan","raw_affiliation_strings":["School of High-Technology for Human Welfare, Tokai University, 317 Nishino, Numazu 410-0395, Japan","School of High Technology for Human Welfare, Tokai University, 317 Nishino, Numazu 410-0395, Japan"],"affiliations":[{"raw_affiliation_string":"School of High-Technology for Human Welfare, Tokai University, 317 Nishino, Numazu 410-0395, Japan","institution_ids":["https://openalex.org/I1314466530"]},{"raw_affiliation_string":"School of High Technology for Human Welfare, Tokai University, 317 Nishino, Numazu 410-0395, Japan","institution_ids":["https://openalex.org/I1314466530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112718564","display_name":"Tomio Hirata","orcid":null},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tomio Hirata","raw_affiliation_strings":["Faculty of Engineering, Nagoya University, Chikusa-ku, Nagoya 464-8603, Japan","Faculty of Engineering, Nagoya University, Chikusa-ku, Nagoya 464-8603, Japan#TAB#"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Nagoya University, Chikusa-ku, Nagoya 464-8603, Japan","institution_ids":["https://openalex.org/I60134161"]},{"raw_affiliation_string":"Faculty of Engineering, Nagoya University, Chikusa-ku, Nagoya 464-8603, Japan#TAB#","institution_ids":["https://openalex.org/I60134161"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023193789"],"corresponding_institution_ids":["https://openalex.org/I1314466530"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":2.0859,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.87752951,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"87","issue":"4","first_page":"179","last_page":"186"},"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.9994000196456909,"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.9994000196456909,"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.9955999851226807,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/combinatorics","display_name":"Combinatorics","score":0.6497346758842468},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.6200589537620544},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6063056588172913},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5786541700363159},{"id":"https://openalex.org/keywords/point-in-polygon","display_name":"Point in polygon","score":0.5600632429122925},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5548049807548523},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5467944145202637},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49921584129333496},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4722931683063507},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46983596682548523},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.46538037061691284},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41855835914611816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4136769771575928},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.29352885484695435},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.14841297268867493},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08703768253326416}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6497346758842468},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.6200589537620544},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6063056588172913},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5786541700363159},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.5600632429122925},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5548049807548523},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5467944145202637},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49921584129333496},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4722931683063507},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46983596682548523},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.46538037061691284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41855835914611816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4136769771575928},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.29352885484695435},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.14841297268867493},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08703768253326416},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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":[{"id":"doi:10.1016/s0020-0190(03)00284-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(03)00284-9","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W115685709","https://openalex.org/W1974433908","https://openalex.org/W2008416425","https://openalex.org/W2033163437","https://openalex.org/W2043003284","https://openalex.org/W2046419297","https://openalex.org/W2106413026","https://openalex.org/W2123945156","https://openalex.org/W2132339863","https://openalex.org/W2144420678","https://openalex.org/W2145459554","https://openalex.org/W2158652185","https://openalex.org/W4213368447","https://openalex.org/W6604671986","https://openalex.org/W6659042292","https://openalex.org/W6681412865"],"related_works":["https://openalex.org/W4286986030","https://openalex.org/W3198582276","https://openalex.org/W4315798097","https://openalex.org/W141463223","https://openalex.org/W4297801804","https://openalex.org/W2951545900","https://openalex.org/W4308609420","https://openalex.org/W3014595637","https://openalex.org/W2381384555","https://openalex.org/W1567841542"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}