{"id":"https://openalex.org/W2090279674","doi":"https://doi.org/10.1109/rivf.2012.6169857","title":"A Heuristic Algorithm for Finding the Closest Trio of 3-Colored Points from a Given Set of 3-Colored Points on Plane","display_name":"A Heuristic Algorithm for Finding the Closest Trio of 3-Colored Points from a Given Set of 3-Colored Points on Plane","publication_year":2012,"publication_date":"2012-02-01","ids":{"openalex":"https://openalex.org/W2090279674","doi":"https://doi.org/10.1109/rivf.2012.6169857","mag":"2090279674"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2012.6169857","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2012.6169857","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","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/A5101752196","display_name":"Trung Ngoc Nguyen","orcid":"https://orcid.org/0000-0002-7415-4390"},"institutions":[{"id":"https://openalex.org/I4210104442","display_name":"Ho Chi Minh City University of Education","ror":"https://ror.org/01cs0jg44","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210104442"]},{"id":"https://openalex.org/I23582244","display_name":"Ho Chi Minh City University of Science","ror":"https://ror.org/05jfbgm49","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I23582244"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Trung N. Nguyen","raw_affiliation_strings":["Department of Computer science, HCMC University of Pedagogy, Ho Chi Minh, Vietnam","Dept. of Comput. Sci., HCMC Univ. of Pedagogy, Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"Department of Computer science, HCMC University of Pedagogy, Ho Chi Minh, Vietnam","institution_ids":["https://openalex.org/I4210104442"]},{"raw_affiliation_string":"Dept. of Comput. Sci., HCMC Univ. of Pedagogy, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I23582244"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078878666","display_name":"Duc Anh Duong","orcid":"https://orcid.org/0000-0002-6329-665X"},"institutions":[{"id":"https://openalex.org/I4210104442","display_name":"Ho Chi Minh City University of Education","ror":"https://ror.org/01cs0jg44","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210104442"]},{"id":"https://openalex.org/I23582244","display_name":"Ho Chi Minh City University of Science","ror":"https://ror.org/05jfbgm49","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I23582244"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Duc A. Duong","raw_affiliation_strings":["Department of Computer science, HCMC University of Pedagogy, Ho Chi Minh, Vietnam","Dept. of Comput. Sci., HCMC Univ. of Sci., Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"Department of Computer science, HCMC University of Pedagogy, Ho Chi Minh, Vietnam","institution_ids":["https://openalex.org/I4210104442"]},{"raw_affiliation_string":"Dept. of Comput. Sci., HCMC Univ. of Sci., Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I23582244"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101752196"],"corresponding_institution_ids":["https://openalex.org/I23582244","https://openalex.org/I4210104442"],"apc_list":null,"apc_paid":null,"fwci":0.7056,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.79146919,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"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.9994999766349792,"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.9994999766349792,"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.9861999750137329,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9842000007629395,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/colored","display_name":"Colored","score":0.9238600730895996},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.8084408044815063},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.70371013879776},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.6143501400947571},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5878287553787231},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5666705965995789},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4901760220527649},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48452967405319214},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.43342870473861694},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37927690148353577},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23087656497955322},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07750564813613892}],"concepts":[{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.9238600730895996},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.8084408044815063},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.70371013879776},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.6143501400947571},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5878287553787231},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5666705965995789},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4901760220527649},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48452967405319214},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.43342870473861694},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37927690148353577},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23087656497955322},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07750564813613892},{"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf.2012.6169857","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2012.6169857","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1967005434","https://openalex.org/W2007610503","https://openalex.org/W2149906774","https://openalex.org/W4210521336"],"related_works":["https://openalex.org/W2157747993","https://openalex.org/W2908074373","https://openalex.org/W4250008887","https://openalex.org/W2962789953","https://openalex.org/W2042426695","https://openalex.org/W2189603398","https://openalex.org/W4299527166","https://openalex.org/W2084691280","https://openalex.org/W889844791","https://openalex.org/W2351580801"],"abstract_inverted_index":{"The":[0,86],"problem":[1,39],"considering":[2],"in":[3],"this":[4,62,70,84],"paper":[5],"is":[6,36,89],"as":[7],"follows:":[8],"Given":[9],"n":[10],"red":[11],"points,":[12],"m":[13],"green":[14],"points":[15,19,29,55],"and":[16,56],"p":[17],"blue":[18],"on":[20,91],"plane,":[21],"how":[22],"to":[23,82],"find":[24,57],"a":[25,65,75,79],"trio":[26],"of":[27,51],"red-green-blue":[28],"such":[30],"that":[31],"the":[32,58],"distance":[33],"between":[34],"them":[35],"smallest.":[37],"This":[38],"could":[40],"be":[41],"solved":[42],"by":[43],"an":[44],"exhaustive":[45],"search":[46],"algorithm:":[47],"test":[48],"all":[49],"trios":[50],"3":[52],"different":[53],"colored":[54],"closest":[59],"one.":[60],"However,":[61],"algorithm":[63,77,88],"has":[64],"big":[66],"complexity:":[67],"O(nmp).":[68],"In":[69],"paper,":[71],"we":[72],"will":[73],"present":[74],"heuristic":[76,87],"with":[78],"better":[80],"complexity":[81],"solve":[83],"problem.":[85],"based":[90],"2D":[92],"Voronoi":[93],"diagram.":[94]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}