{"id":"https://openalex.org/W2025943769","doi":"https://doi.org/10.1109/ic3.2013.6612182","title":"Random polygon generation using ‘GRP_AS’ heuristic","display_name":"Random polygon generation using ‘GRP_AS’ heuristic","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W2025943769","doi":"https://doi.org/10.1109/ic3.2013.6612182","mag":"2025943769"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic3.2013.6612182","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5042451644","display_name":"Sanjib Sadhu","orcid":"https://orcid.org/0009-0009-0198-1780"},"institutions":[{"id":"https://openalex.org/I155837530","display_name":"National Institute of Technology Durgapur","ror":"https://ror.org/04ds0jm32","country_code":"IN","type":"education","lineage":["https://openalex.org/I155837530"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sanjib Sadhu","raw_affiliation_strings":["Department of Computer Science and Engg, National Institute of Technology, Durgapur, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engg, National Institute of Technology, Durgapur, India","institution_ids":["https://openalex.org/I155837530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015195513","display_name":"Niraj Kumar","orcid":"https://orcid.org/0000-0002-7918-5188"},"institutions":[{"id":"https://openalex.org/I155837530","display_name":"National Institute of Technology Durgapur","ror":"https://ror.org/04ds0jm32","country_code":"IN","type":"education","lineage":["https://openalex.org/I155837530"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Niraj Kumar","raw_affiliation_strings":["Department of Computer Science and Engg, National Institute of Technology, Durgapur, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engg, National Institute of Technology, Durgapur, India","institution_ids":["https://openalex.org/I155837530"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"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":65},"biblio":{"volume":null,"issue":null,"first_page":"13","last_page":"17"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Mesh Generation Algorithms","score":0.9993,"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":"Mesh Generation Algorithms","score":0.9993,"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":"Trajectory Data Mining and Analysis","score":0.9938,"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/T10191","display_name":"Simultaneous Localization and Mapping","score":0.9872,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/heuristics","display_name":"Heuristics","score":0.66984904},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.59616774},{"id":"https://openalex.org/keywords/geometric-optimization","display_name":"Geometric Optimization","score":0.571351},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.5629603},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational Geometry","score":0.532827},{"id":"https://openalex.org/keywords/location-prediction","display_name":"Location Prediction","score":0.519032},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"Approximation Algorithms","score":0.517412},{"id":"https://openalex.org/keywords/graph-optimization","display_name":"Graph Optimization","score":0.507732}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.77316284},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.66984904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6313446},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.59616774},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.5629603},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5122716},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.49635893},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44829252},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44383982},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4436096},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4288259},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4260695},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39900753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3925242},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.16586065},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.14259866},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.13483319},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.08997461},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06975773},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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.1109/ic3.2013.6612182","pdf_url":null,"source":null,"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":5,"referenced_works":["https://openalex.org/W1497676467","https://openalex.org/W1557760894","https://openalex.org/W1988912457","https://openalex.org/W2082230637","https://openalex.org/W4385265211"],"related_works":["https://openalex.org/W53644101","https://openalex.org/W4296464845","https://openalex.org/W2987051945","https://openalex.org/W2896729805","https://openalex.org/W2608536130","https://openalex.org/W2389833224","https://openalex.org/W2372903818","https://openalex.org/W2154329468","https://openalex.org/W2102467404","https://openalex.org/W1567510565"],"abstract_inverted_index":{"Random":[0],"polygon":[1,29],"Generation":[2],"from":[3,30],"a":[4,26,31,62,131],"given":[5,32],"set":[6,33],"of":[7,34,91,97,127,130,137,152,170],"points":[8,36],"is":[9,52,109,122,148],"very":[10],"important":[11],"for":[12,71],"different":[13],"applications.":[14],"A":[15],"heuristic":[16,43,69,94,143,155,175],"termed":[17],"as":[18,156,158],"\"GRP_AS\"":[19,121,142,174],"has":[20,176],"been":[21,177],"proposed":[22,119],"here":[23],"to":[24,60,86,110],"generate":[25,61],"random":[27,98,128],"simple":[28,63],"`n'":[35],"in":[37,95,173],"2-Dimensional":[38],"plane.":[39],"The":[40,118,161],"\"2-Opt":[41,92,153],"Move\"":[42,93,154],"with":[44,75,114],"time":[45,76,101,116,146],"complexity":[46,77],"O(n":[47,78],"4":[50],")":[51,82],"the":[53,57,72,125,138,168],"best":[54],"known":[55],"among":[56],"existing":[58],"heuristics":[59],"polygon.":[64],"We":[65],"recently":[66],"designed":[67],"another":[68],"\"GRP_CH\"":[70,159],"same":[73],"problem":[74],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3":[81],"which":[83,147],"was":[84],"shown":[85],"be":[87],"better":[88],"than":[89,150],"that":[90,151],"terms":[96],"behaviour":[99],"and":[100,134,164],"complexity.":[102,117],"In":[103],"this":[104],"work,":[105],"our":[106],"main":[107],"objective":[108],"design":[111],"an":[112],"algorithm":[113],"reduced":[115],"heuristic,":[120],"based":[123],"on":[124,167],"principle":[126],"selection":[129],"line":[132],"segment":[133],"angular":[135],"sorting":[136],"point":[139],"set.":[140],"This":[141],"takes":[144],"O(nlogn)":[145],"less":[149],"well":[157],"heuristic.":[160],"lower":[162],"bound":[163,166],"upper":[165],"number":[169],"polygons":[171],"generated":[172],"computed.":[178]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2025943769","counts_by_year":[],"updated_date":"2024-10-03T16:07:06.736442","created_date":"2016-06-24"}
