{"id":"https://openalex.org/W4319454640","doi":"https://doi.org/10.1142/s1793830923500143","title":"OFC-Delaunay triangulation: A new efficient algorithm for merging two adjacent Delaunay triangulations","display_name":"OFC-Delaunay triangulation: A new efficient algorithm for merging two adjacent Delaunay triangulations","publication_year":2023,"publication_date":"2023-02-09","ids":{"openalex":"https://openalex.org/W4319454640","doi":"https://doi.org/10.1142/s1793830923500143"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830923500143","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830923500143","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and 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/A5038052046","display_name":"Phan Thanh An","orcid":"https://orcid.org/0000-0002-1903-3510"},"institutions":[{"id":"https://openalex.org/I123565023","display_name":"Vietnam National University Ho Chi Minh City","ror":"https://ror.org/00waaqh38","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023"]},{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Phan Thanh An","raw_affiliation_strings":["Institute of Mathematical and Computational Sciences (IMACS) and Faculty of Applied Science, Ho Chi Minh City, University of Technology (HCMUT), 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Vietnam","Vietnam National University Ho Chi Minh City, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematical and Computational Sciences (IMACS) and Faculty of Applied Science, Ho Chi Minh City, University of Technology (HCMUT), 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]},{"raw_affiliation_string":"Vietnam National University Ho Chi Minh City, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I123565023"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004677929","display_name":"Tr\u1ecbnh Minh \u0110\u1ee9c","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115718","display_name":"Thai Nguyen University","ror":"https://ror.org/02128gy91","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210115718"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Trinh Minh Duc","raw_affiliation_strings":["Department of Information Technology, Thai Nguyen University of Information & Communication Technology, Quyet Thang Ward, Thai Nguyen City, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Thai Nguyen University of Information & Communication Technology, Quyet Thang Ward, Thai Nguyen City, Vietnam","institution_ids":["https://openalex.org/I4210115718"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047758356","display_name":"\u0110\u1eb7ng Th\u1ecb Oanh","orcid":"https://orcid.org/0000-0002-5248-4276"},"institutions":[{"id":"https://openalex.org/I1341015664","display_name":"Ministry of Education and Training","ror":"https://ror.org/00drv3378","country_code":"VN","type":"government","lineage":["https://openalex.org/I1341015664"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Dang Thi Oanh","raw_affiliation_strings":["Information Technology Department, Ministry of Education and Training, No 35, Dai Co Viet, Hai Ba Trung District, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Technology Department, Ministry of Education and Training, No 35, Dai Co Viet, Hai Ba Trung District, Hanoi, Vietnam","institution_ids":["https://openalex.org/I1341015664"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4221,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.85843814,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":"16","issue":"02","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.9939000010490417,"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.9939000010490417,"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/T12698","display_name":"3D Modeling in Geospatial Applications","score":0.9595000147819519,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9035000205039978,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.9667177200317383},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.8951536417007446},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.8690258264541626},{"id":"https://openalex.org/keywords/pitteway-triangulation","display_name":"Pitteway triangulation","score":0.8269824981689453},{"id":"https://openalex.org/keywords/point-set-triangulation","display_name":"Point set triangulation","score":0.6261317729949951},{"id":"https://openalex.org/keywords/chews-second-algorithm","display_name":"Chew's second algorithm","score":0.6091001033782959},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.6016536355018616},{"id":"https://openalex.org/keywords/rupperts-algorithm","display_name":"Ruppert's algorithm","score":0.5863274335861206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5402870178222656},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.5164432525634766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4607487916946411},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45593661069869995},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.4281568229198456},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36118894815444946},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1916925609111786}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.9667177200317383},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.8951536417007446},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.8690258264541626},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.8269824981689453},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.6261317729949951},{"id":"https://openalex.org/C183342303","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Chew's second algorithm","level":4,"score":0.6091001033782959},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.6016536355018616},{"id":"https://openalex.org/C99886907","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Ruppert's algorithm","level":4,"score":0.5863274335861206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5402870178222656},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.5164432525634766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4607487916946411},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45593661069869995},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.4281568229198456},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36118894815444946},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1916925609111786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830923500143","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830923500143","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1515864807","https://openalex.org/W1977807632","https://openalex.org/W1982483258","https://openalex.org/W1987569615","https://openalex.org/W1991064236","https://openalex.org/W2002827932","https://openalex.org/W2003402773","https://openalex.org/W2004138302","https://openalex.org/W2005314985","https://openalex.org/W2052165970","https://openalex.org/W2054586770","https://openalex.org/W2057512681","https://openalex.org/W2060510973","https://openalex.org/W2070164574","https://openalex.org/W2075058630","https://openalex.org/W2087686493","https://openalex.org/W2092924973","https://openalex.org/W2097944783","https://openalex.org/W2762232873","https://openalex.org/W4232727012","https://openalex.org/W4254977685","https://openalex.org/W4298410530"],"related_works":["https://openalex.org/W2359979928","https://openalex.org/W2172589357","https://openalex.org/W1972369894","https://openalex.org/W2350914983","https://openalex.org/W4254406543","https://openalex.org/W2059744002","https://openalex.org/W149465645","https://openalex.org/W2132105558","https://openalex.org/W2369820366","https://openalex.org/W2149044706"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"an":[5],"efficient":[6],"algorithm,":[7],"namely":[8],"Orienting":[9,33],"and":[10,55,77,90,111],"Final":[11],"Circles":[12],"(OFC)-Delaunay":[13],"Triangulation,":[14],"for":[15],"constructing":[16],"the":[17,27,30],"Delaunay":[18,83],"triangulation":[19],"of":[20,29,32,75],"a":[21,91],"finite":[22],"planar":[23],"point":[24],"set":[25],"using":[26],"idea":[28],"Method":[31],"Curves":[34],"(introduced":[35],"by":[36,87],"Phu":[37],"in":[38,109],"Zur":[39],"L\u00f6sung":[40],"einer":[41],"regul\u00e4ren":[42],"Aufgabenklasse":[43],"der":[44],"optimalen":[45],"Steuerung":[46],"im":[47],"Groen":[48],"mittels":[49],"Orientierungskurven,":[50],"Optimization":[51,69],"18(1)":[52],"(1987)":[53,71],"65\u201381":[54],"Ein":[56],"konstruktives":[57],"L\u00f6sungsverfahren":[58],"f\u00fcr":[59],"das":[60],"Problem":[61],"des":[62],"Inpolygons":[63],"kleinsten":[64],"Umfangs":[65],"von":[66],"J.":[67],"Steiner,":[68],"18(3)":[70],"349\u2013359).":[72],"The":[73,82,105],"concepts":[74],"orienting":[76,88],"final":[78,92],"circles":[79,89],"are":[80,85,115],"introduced.":[81],"edges":[84],"determined":[86],"circle.":[93],"Our":[94],"algorithm":[95,106],"has":[96],"[Formula:":[97],"see":[98,100],"text]([Formula:":[99],"text])":[101],"worst-case":[102],"running":[103],"time.":[104],"is":[107],"implemented":[108],"Python":[110],"some":[112],"numerical":[113],"examples":[114],"presented.":[116]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}