{"id":"https://openalex.org/W2114374706","doi":"https://doi.org/10.1142/s0218195993000063","title":"OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS","display_name":"OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS","publication_year":1993,"publication_date":"1993-03-01","ids":{"openalex":"https://openalex.org/W2114374706","doi":"https://doi.org/10.1142/s0218195993000063","mag":"2114374706"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195993000063","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195993000063","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/A5025369740","display_name":"Svante Carlsson","orcid":null},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"SVANTE CARLSSON","raw_affiliation_strings":["Department of Computer Science, Lule\u00e5 University of Technology 951 87 Lule\u00e5, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lule\u00e5 University of Technology 951 87 Lule\u00e5, Sweden","institution_ids":["https://openalex.org/I190632392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101713320","display_name":"Bengt J. Nilsson","orcid":"https://orcid.org/0000-0002-1342-8618"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"BENGT J. NILSSON","raw_affiliation_strings":["Department of Computer Science, Lun\u00e5 University, Box 118, 221 00 Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lun\u00e5 University, Box 118, 221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010170603","display_name":"Simeon Ntafos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"SIMEON NTAFOS","raw_affiliation_strings":["Computer Science Program, University of Texas at Dallas, Richardson, TX 75083\u20130688, U.S.A"],"affiliations":[{"raw_affiliation_string":"Computer Science Program, University of Texas at Dallas, Richardson, TX 75083\u20130688, U.S.A","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025369740"],"corresponding_institution_ids":["https://openalex.org/I190632392"],"apc_list":null,"apc_paid":null,"fwci":0.3924,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.63769175,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"03","issue":"01","first_page":"85","last_page":"105"},"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.9998000264167786,"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.9998000264167786,"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.9879999756813049,"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/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.9876999855041504,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/guard","display_name":"Guard (computer science)","score":0.6415554881095886},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6037442684173584},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49782729148864746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44665664434432983},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33924317359924316},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28558480739593506}],"concepts":[{"id":"https://openalex.org/C141141315","wikidata":"https://www.wikidata.org/wiki/Q2379942","display_name":"Guard (computer science)","level":2,"score":0.6415554881095886},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6037442684173584},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49782729148864746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44665664434432983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33924317359924316},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28558480739593506},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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/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.1142/s0218195993000063","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195993000063","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6299999952316284,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W3115803","https://openalex.org/W1595528547","https://openalex.org/W1612751597","https://openalex.org/W2005314985","https://openalex.org/W2008353306","https://openalex.org/W2008416425","https://openalex.org/W2044157824","https://openalex.org/W2063442090","https://openalex.org/W2087422927","https://openalex.org/W2094658339","https://openalex.org/W2158652185"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2384472745"],"abstract_inverted_index":{"A":[0],"watchman,":[1],"in":[2,89,129],"the":[3,26,42,46,51,59,83,123],"terminology":[4],"of":[5,22,28,62,86,100,126],"art":[6,43],"galleries,":[7],"is":[8,73,105],"a":[9,32,38,69,77,90,112,130],"mobile":[10],"guard.":[11],"We":[12,24,55,75,110],"consider":[13],"several":[14],"watchman":[15,52,71],"and":[16,50],"guard":[17],"problems":[18],"for":[19,102,107],"different":[20],"classes":[21],"polygons.":[23,109],"introduce":[25],"notion":[27],"vision":[29,63],"spans":[30],"along":[31,68],"path":[33],"or":[34],"route":[35,53,72],"which":[36],"provide":[37,76],"natural":[39],"connection":[40],"between":[41],"gallery":[44],"problem,":[45,96],"m-watchmen":[47,94],"routes":[48,95,101],"problem":[49],"problem.":[54],"prove":[56],"that":[57],"finding":[58],"minimum":[60],"number":[61],"points,":[64],"i.e.,":[65],"static":[66,87],"guards,":[67],"shortest":[70],"NP-hard.":[74],"linear":[78],"time":[79],"algorithm":[80,120],"to":[81,121],"compute":[82,122],"best":[84,124],"set":[85,125],"guards":[88],"histogram":[91],"polygon.":[92],"The":[93],"minimize":[97],"total":[98],"length":[99],"m":[103,117,127],"watchmen,":[104],"NP-hard":[106],"simple":[108],"give":[111],"\u0398(n":[113],"3":[114],"+n":[115],"2":[116,118],")-time":[119],"watchmen":[128],"histogram.":[131]},"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":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}