{"id":"https://openalex.org/W7162528793","doi":"https://doi.org/10.4230/lipics.socg.2026.108","title":"CG#Hunters Approach to Central Triangulation Under Parallel Flip Operations (CG Challenge)","display_name":"CG#Hunters Approach to Central Triangulation Under Parallel Flip Operations (CG Challenge)","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162528793","doi":"https://doi.org/10.4230/lipics.socg.2026.108"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.socg.2026.108","is_oa":true,"landing_page_url":"https://github.com/jagunlee/CGSHOP26.git","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"CG Challenge"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://github.com/jagunlee/CGSHOP26.git","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031262968","display_name":"Jaegun Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I123900574","display_name":"Pohang University of Science and Technology","ror":"https://ror.org/04xysgw12","country_code":"KR","type":"education","lineage":["https://openalex.org/I123900574"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Lee, Jaegun","raw_affiliation_strings":["Department of Computer Science and Engineering, Pohang University of Science and Technology, Republic of Korea"],"raw_orcid":"https://orcid.org/0009-0007-8835-2957","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Pohang University of Science and Technology, Republic of Korea","institution_ids":["https://openalex.org/I123900574"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137145452","display_name":"Seokyun Kang","orcid":"https://orcid.org/0009-0000-7934-4356"},"institutions":[{"id":"https://openalex.org/I123900574","display_name":"Pohang University of Science and Technology","ror":"https://ror.org/04xysgw12","country_code":"KR","type":"education","lineage":["https://openalex.org/I123900574"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kang, Seokyun","raw_affiliation_strings":["Graduate School of Artificial Intelligence, Pohang University of Science and Technology, Republic of Korea"],"raw_orcid":"https://orcid.org/0009-0000-7934-4356","affiliations":[{"raw_affiliation_string":"Graduate School of Artificial Intelligence, Pohang University of Science and Technology, Republic of Korea","institution_ids":["https://openalex.org/I123900574"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101626237","display_name":"Hyeonseok Lee","orcid":"https://orcid.org/0000-0003-4334-2409"},"institutions":[{"id":"https://openalex.org/I48566637","display_name":"Ulsan National Institute of Science and Technology","ror":"https://ror.org/017cjz748","country_code":"KR","type":"education","lineage":["https://openalex.org/I48566637"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Lee, Hyeonseok","raw_affiliation_strings":["Department of Computer Science and Engineering, Ulsan National Institute of Science and Technology, Republic of Korea"],"raw_orcid":"https://orcid.org/0009-0003-6264-9366","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Ulsan National Institute of Science and Technology, Republic of Korea","institution_ids":["https://openalex.org/I48566637"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031297713","display_name":"Hyeyun Yang","orcid":"https://orcid.org/0000-0001-5949-8673"},"institutions":[{"id":"https://openalex.org/I125608817","display_name":"Korea Institute for Advanced Study","ror":"https://ror.org/041hz9568","country_code":"KR","type":"facility","lineage":["https://openalex.org/I125608817"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yang, Hyeyun","raw_affiliation_strings":["School of Computational Sciences, Korea Institute for Advanced Study, Seoul, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0001-5949-8673","affiliations":[{"raw_affiliation_string":"School of Computational Sciences, Korea Institute for Advanced Study, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I125608817"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5137131367","display_name":"Taehoon Ahn","orcid":"https://orcid.org/0000-0001-6588-4431"},"institutions":[{"id":"https://openalex.org/I31766871","display_name":"Sookmyung Women's University","ror":"https://ror.org/00vvvt117","country_code":"KR","type":"education","lineage":["https://openalex.org/I31766871"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Ahn, Taehoon","raw_affiliation_strings":["Department of Computer Science, Sookmyung Women\u2019s University, Seoul, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0001-6588-4431","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Sookmyung Women\u2019s University, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I31766871"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.86262991,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.41769999265670776,"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.41769999265670776,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.08990000188350677,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.05950000137090683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.8192999958992004},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6055999994277954},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.51419997215271},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5023999810218811},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4478999972343445},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4088999927043915},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.3449000120162964}],"concepts":[{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.8192999958992004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6136999726295471},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6055999994277954},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5379999876022339},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.51419997215271},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5023999810218811},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4478999972343445},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3693000078201294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35510000586509705},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3449000120162964},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.30649998784065247},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2883000075817108},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.27239999175071716},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.2542000114917755},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2508000135421753}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:doi:10.4230/lipics.socg.2026.108","is_oa":true,"landing_page_url":"https://github.com/jagunlee/CGSHOP26.git","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"CG Challenge"},{"id":"pmh:oai:drops-oai.dagstuhl.de:25914","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.108","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.socg.2026.108","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.108","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:doi:10.4230/lipics.socg.2026.108","is_oa":true,"landing_page_url":"https://github.com/jagunlee/CGSHOP26.git","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"CG Challenge"},"sustainable_development_goals":[{"score":0.7560361623764038,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,5,20,26,34,50,56,67,78],"CG:SHOP":[2],"2026":[3],"Challenge,":[4],"goal":[6],"is":[7,91],"to":[8,48,93],"compute":[9],"a":[10,14,71,82,88],"central":[11,79,109],"triangulation":[12,80],"for":[13,117],"given":[15],"set":[16,23],"of":[17,28,53],"triangulations":[18,57,110],"on":[19],"same":[21],"point":[22],"while":[24],"minimizing":[25],"sum":[27],"parallel":[29,46,114],"flip":[30,115],"distances.":[31],"To":[32,61],"address":[33],"problem,":[35],"our":[36],"team":[37],"(CG#Hunters)":[38],"constructs":[39],"an":[40],"initial":[41],"solution":[42],"by":[43,69,106],"iteratively":[44],"applying":[45],"flips":[47],"reduce":[49],"total":[51],"number":[52],"crossings":[54],"between":[55],"until":[58],"none":[59],"remain.":[60],"optimize":[62],"these":[63,99],"solutions,":[64],"we":[65,102],"shorten":[66],"paths":[68,116],"using":[70],"score-based":[72],"greedy":[73],"edge":[74],"selection":[75],"and":[76],"refine":[77],"via":[81],"large":[83,96],"scale":[84],"neighborhood":[85],"search.":[86],"Additionally,":[87],"representative-set-based":[89],"approach":[90],"utilized":[92],"efficiently":[94],"handle":[95],"instances.":[97,120],"With":[98],"combined":[100],"approaches,":[101],"achieved":[103],"third":[104],"place":[105],"successfully":[107],"computing":[108],"with":[111],"sufficiently":[112],"short":[113],"all":[118],"250":[119]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-28T00:00:00"}