乐胖代购免代理版

{"id":"https://openalex.org/W2123945156","doi":"https://doi.org/10.1142/s0218195993000233","title":"AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES","display_name":"AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES","publication_year":1993,"publication_date":"1993-12-01","ids":{"openalex":"https://openalex.org/W2123945156","doi":"https://doi.org/10.1142/s0218195993000233","mag":"2123945156"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195993000233","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_indexed_in_scopus":true,"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":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/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":"funder","lineage":["https://openalex.org/I1314466530"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"XUEHOU TAN","raw_affiliation_strings":["School of High-Technology for Human Welfare, Tokai University, 317 Nishino, Numazu 410\u201303, Japan"],"affiliations":[{"raw_affiliation_string":"School of High-Technology for Human Welfare, Tokai University, 317 Nishino, Numazu 410\u201303, Japan","institution_ids":["https://openalex.org/I1314466530"]}]},{"author_position":"middle","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":"funder","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, Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Nagoya University, Chikusa-ku, Nagoya, 464, Japan","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103350478","display_name":"Yasuyoshi Inagaki","orcid":null},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"funder","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"YASUYOSHI INAGAKI","raw_affiliation_strings":["Faculty of Engineering, Nagoya University, Chikusa-ku, Nagoya, 464, Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Nagoya University, Chikusa-ku, Nagoya, 464, Japan","institution_ids":["https://openalex.org/I60134161"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.897,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.919508,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":92,"max":93},"biblio":{"volume":"03","issue":"04","first_page":"351","last_page":"365"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9956,"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.9956,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9669,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9108,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6672495}],"concepts":[{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6672495},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6140566},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5959604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.57795465},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.57471997},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.547655},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.49547565},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4500459},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2856124},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.1285617},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09348318},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/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}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195993000233","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_indexed_in_scopus":true,"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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W53644101","https://openalex.org/W4296464845","https://openalex.org/W3042074040","https://openalex.org/W3014595637","https://openalex.org/W2987051945","https://openalex.org/W2608536130","https://openalex.org/W2389833224","https://openalex.org/W2370332886","https://openalex.org/W2154329468","https://openalex.org/W2102467404"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2],"finding":[3],"the":[4,42,51,69],"shortest":[5,52],"watchman":[6,26,53],"route":[7,23,27,54],"in":[8,55],"a":[9,14,25,61],"simple":[10,62],"polygon":[11,63],"P":[12,32],"through":[13],"point":[15,30,40],"s":[16],"on":[17],"its":[18],"boundary":[19],"is":[20,24],"considered.":[21],"A":[22],"if":[28],"every":[29],"inside":[31],"can":[33],"be":[34],"seen":[35],"from":[36],"at":[37],"least":[38],"one":[39],"along":[41],"route.":[43],"We":[44],"present":[45],"an":[46],"incremental":[47],"algorithm":[48],"that":[49],"constructs":[50],"O(n":[56,71],"3":[57],")":[58,73],"time":[59],"for":[60],"with":[64],"n":[65],"edges.":[66],"This":[67],"improves":[68],"previous":[70],"4":[72],"bound.":[74]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2123945156","counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-03-18T20:51:28.087030","created_date":"2016-06-24"}