{"id":"https://openalex.org/W2144210560","doi":"https://doi.org/10.1109/icsmc.2004.1398421","title":"Guarding polygons with holes for robot motion planning applications","display_name":"Guarding polygons with holes for robot motion planning applications","publication_year":2005,"publication_date":"2005-04-06","ids":{"openalex":"https://openalex.org/W2144210560","doi":"https://doi.org/10.1109/icsmc.2004.1398421","mag":"2144210560"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2004.1398421","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2004.1398421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)","raw_type":"proceedings-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/A5069884464","display_name":"Ashraf Elnagar","orcid":"https://orcid.org/0000-0003-2265-7268"},"institutions":[{"id":"https://openalex.org/I29891158","display_name":"University of Sharjah","ror":"https://ror.org/00engpz63","country_code":"AE","type":"education","lineage":["https://openalex.org/I29891158"]}],"countries":["AE"],"is_corresponding":true,"raw_author_name":"A. Elnagar","raw_affiliation_strings":["Intelligent Systems & Infrastructure Group, Department of Computer Science, University of Sharjah, Sharjah, UAE","Dept. of Comput. Sci., Sharjah Univ.#TAB#"],"affiliations":[{"raw_affiliation_string":"Intelligent Systems & Infrastructure Group, Department of Computer Science, University of Sharjah, Sharjah, UAE","institution_ids":["https://openalex.org/I29891158"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Sharjah Univ.#TAB#","institution_ids":["https://openalex.org/I29891158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090861373","display_name":"Leena Lulu","orcid":"https://orcid.org/0009-0004-4586-1485"},"institutions":[{"id":"https://openalex.org/I29891158","display_name":"University of Sharjah","ror":"https://ror.org/00engpz63","country_code":"AE","type":"education","lineage":["https://openalex.org/I29891158"]}],"countries":["AE"],"is_corresponding":false,"raw_author_name":"L. Lulu","raw_affiliation_strings":["Intelligent Systems & Infrastructure Group, Department of Computer Science, University of Sharjah, Sharjah, UAE","Dept. of Comput. Sci., Sharjah Univ.#TAB#"],"affiliations":[{"raw_affiliation_string":"Intelligent Systems & Infrastructure Group, Department of Computer Science, University of Sharjah, Sharjah, UAE","institution_ids":["https://openalex.org/I29891158"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Sharjah Univ.#TAB#","institution_ids":["https://openalex.org/I29891158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069884464"],"corresponding_institution_ids":["https://openalex.org/I29891158"],"apc_list":null,"apc_paid":null,"fwci":0.5875,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71908447,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"923","last_page":"928"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/robustness","display_name":"Robustness (evolution)","score":0.6875792145729065},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6665434241294861},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6462596654891968},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5413655042648315},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.5303951501846313},{"id":"https://openalex.org/keywords/point-in-polygon","display_name":"Point in polygon","score":0.5189580321311951},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.48927971720695496},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.440774142742157},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4112514853477478},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38675373792648315},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.3843114972114563},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3737887740135193},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3446659445762634},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3410181999206543},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.29803091287612915},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2760232090950012},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23676759004592896},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22863230109214783},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11940664052963257},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07694453001022339}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6875792145729065},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6665434241294861},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6462596654891968},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5413655042648315},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.5303951501846313},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.5189580321311951},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.48927971720695496},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.440774142742157},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4112514853477478},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38675373792648315},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.3843114972114563},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3737887740135193},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3446659445762634},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3410181999206543},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.29803091287612915},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2760232090950012},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23676759004592896},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22863230109214783},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11940664052963257},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07694453001022339},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsmc.2004.1398421","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2004.1398421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1973307935","https://openalex.org/W1983487792","https://openalex.org/W2030535045","https://openalex.org/W2032021349","https://openalex.org/W2038280788","https://openalex.org/W2052223962","https://openalex.org/W2054459484","https://openalex.org/W2063442090","https://openalex.org/W2087422927","https://openalex.org/W2094658339","https://openalex.org/W2126369940","https://openalex.org/W2127379872","https://openalex.org/W2502636724","https://openalex.org/W2796488364","https://openalex.org/W2986240932","https://openalex.org/W4242246215","https://openalex.org/W6823436229"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W320048716","https://openalex.org/W2102467404","https://openalex.org/W141463223","https://openalex.org/W4297801804","https://openalex.org/W2136318972","https://openalex.org/W2951545900","https://openalex.org/W1538329849","https://openalex.org/W53644101","https://openalex.org/W2370449776"],"abstract_inverted_index":{"The":[0,30,78],"art":[1],"gallery":[2,27,37],"problem":[3,23],"is":[4,39,81],"aiming":[5],"at":[6],"finding":[7],"the":[8,22,101,107],"minimum":[9],"number":[10,62],"of":[11,24,63,90,106],"guards":[12,31,65],"to":[13,34,58],"cover":[14,35],"a":[15,26,36,42,53,60,85],"gallery.":[16],"In":[17],"this":[18],"paper,":[19],"we":[20],"consider":[21],"covering":[25],"with":[28,45],"holes.":[29,50],"are":[32],"required":[33],"that":[38],"represented":[40],"as":[41],"simple":[43],"polygon":[44],"n":[46],"vertices":[47],"and":[48,55,74,104],"h":[49],"We":[51],"present":[52],"robust":[54],"fast":[56],"algorithm":[57,80,109],"compute":[59],"small":[61],"vertex":[64],"in":[66,71,88,96,110],"such":[67],"polygons,":[68],"which":[69],"runs":[70],"O(nlogn)":[72],"time":[73],"uses":[75],"O(n)":[76],"storage.":[77],"proposed":[79,108],"not":[82],"only":[83],"offering":[84],"better":[86],"performance":[87],"terms":[89],"computational":[91],"cost":[92],"but":[93],"also":[94],"ease":[95],"implementation.":[97],"Simulation":[98],"results":[99],"demonstrate":[100],"efficiency,":[102],"robustness,":[103],"potential":[105],"motion":[111],"planning":[112],"systems":[113]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}