{"id":"https://openalex.org/W4415624233","doi":"https://doi.org/10.1109/access.2025.3626029","title":"A Linear-Time Greedy Approach With Directional Optimization for Minimum Weight Triangulation of Convex Polygons","display_name":"A Linear-Time Greedy Approach With Directional Optimization for Minimum Weight Triangulation of Convex Polygons","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415624233","doi":"https://doi.org/10.1109/access.2025.3626029"},"language":"en","primary_location":{"id":"doi:10.1109/access.2025.3626029","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3626029","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2025.3626029","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089348789","display_name":"Muhammad Asif Habib","orcid":"https://orcid.org/0000-0002-2675-1975"},"institutions":[{"id":"https://openalex.org/I240666556","display_name":"Imam Mohammad ibn Saud Islamic University","ror":"https://ror.org/05gxjyb39","country_code":"SA","type":"education","lineage":["https://openalex.org/I240666556"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Muhammad Asif Habib","raw_affiliation_strings":["College of Computer and Information Sciences, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh, Saudi Arabia"],"raw_orcid":"https://orcid.org/0000-0002-2675-1975","affiliations":[{"raw_affiliation_string":"College of Computer and Information Sciences, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh, Saudi Arabia","institution_ids":["https://openalex.org/I240666556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007626956","display_name":"Jabeen Sultana","orcid":"https://orcid.org/0000-0001-7214-0035"},"institutions":[{"id":"https://openalex.org/I240666556","display_name":"Imam Mohammad ibn Saud Islamic University","ror":"https://ror.org/05gxjyb39","country_code":"SA","type":"education","lineage":["https://openalex.org/I240666556"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Jabeen Sultana","raw_affiliation_strings":["College of Computer and Information Sciences, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh, Saudi Arabia"],"raw_orcid":"https://orcid.org/0000-0001-7214-0035","affiliations":[{"raw_affiliation_string":"College of Computer and Information Sciences, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh, Saudi Arabia","institution_ids":["https://openalex.org/I240666556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109804879","display_name":"Ali Hamid","orcid":"https://orcid.org/0000-0001-9158-7406"},"institutions":[{"id":"https://openalex.org/I505182","display_name":"National Textile University","ror":"https://ror.org/030dak672","country_code":"PK","type":"education","lineage":["https://openalex.org/I505182"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Hamid Ali","raw_affiliation_strings":["Department of Computer Science, National Textile University, Faisalabad, Pakistan"],"raw_orcid":"https://orcid.org/0000-0001-9158-7406","affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Textile University, Faisalabad, Pakistan","institution_ids":["https://openalex.org/I505182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052136064","display_name":"Naeem Raza","orcid":"https://orcid.org/0000-0002-5913-7832"},"institutions":[{"id":"https://openalex.org/I17120543","display_name":"National University of Modern Languages","ror":"https://ror.org/008dh2426","country_code":"PK","type":"education","lineage":["https://openalex.org/I17120543"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Naeem Raza","raw_affiliation_strings":["Department of Computer Science, National University of Modern Languages, Faisalabad, Pakistan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National University of Modern Languages, Faisalabad, Pakistan","institution_ids":["https://openalex.org/I17120543"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ahmad Amad","orcid":null},"institutions":[{"id":"https://openalex.org/I505182","display_name":"National Textile University","ror":"https://ror.org/030dak672","country_code":"PK","type":"education","lineage":["https://openalex.org/I505182"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Ahmad Amad","raw_affiliation_strings":["Department of Computer Science, National Textile University, Faisalabad, Pakistan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Textile University, Faisalabad, Pakistan","institution_ids":["https://openalex.org/I505182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108139553","display_name":"Hafiz Muhammad Imran","orcid":"https://orcid.org/0000-0003-2840-5096"},"institutions":[{"id":"https://openalex.org/I505182","display_name":"National Textile University","ror":"https://ror.org/030dak672","country_code":"PK","type":"education","lineage":["https://openalex.org/I505182"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Hafiz Muhammad Sajid Imran","raw_affiliation_strings":["Department of Computer Science, National Textile University, Faisalabad, Pakistan"],"raw_orcid":"https://orcid.org/0000-0003-2840-5096","affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Textile University, Faisalabad, Pakistan","institution_ids":["https://openalex.org/I505182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060339515","display_name":"Muhammad Abdul Qayum","orcid":"https://orcid.org/0000-0002-5912-2876"},"institutions":[{"id":"https://openalex.org/I505182","display_name":"National Textile University","ror":"https://ror.org/030dak672","country_code":"PK","type":"education","lineage":["https://openalex.org/I505182"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Muhammad Abdul Qayum","raw_affiliation_strings":["Department of Computer Science, National Textile University, Faisalabad, Pakistan"],"raw_orcid":"https://orcid.org/0000-0002-5912-2876","affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Textile University, Faisalabad, Pakistan","institution_ids":["https://openalex.org/I505182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055899490","display_name":"Mudassar Ahmad","orcid":"https://orcid.org/0000-0002-6366-8230"},"institutions":[{"id":"https://openalex.org/I505182","display_name":"National Textile University","ror":"https://ror.org/030dak672","country_code":"PK","type":"education","lineage":["https://openalex.org/I505182"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Mudassar Ahmad","raw_affiliation_strings":["Department of Computer Science, National Textile University, Faisalabad, Pakistan"],"raw_orcid":"https://orcid.org/0000-0002-6366-8230","affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Textile University, Faisalabad, Pakistan","institution_ids":["https://openalex.org/I505182"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.51742788,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":null,"first_page":"188630","last_page":"188649"},"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.9573000073432922,"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.9573000073432922,"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/T10719","display_name":"3D Shape Modeling and Analysis","score":0.008200000040233135,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.0031999999191612005,"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.5659999847412109},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.515500009059906},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.49399998784065247},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.44609999656677246},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4438000023365021},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.43639999628067017},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.4352000057697296},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.4056999981403351}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5936999917030334},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.5659999847412109},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5637999773025513},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.515500009059906},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.49399998784065247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46320000290870667},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.44609999656677246},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4438000023365021},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.43639999628067017},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.4352000057697296},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.4056999981403351},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.40459999442100525},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.3822999894618988},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.3801000118255615},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.373199999332428},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3643999993801117},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.32839998602867126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32339999079704285},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3174999952316284}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2025.3626029","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3626029","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:33bfc6d6bc1c46358e0296ebc30b8320","is_oa":true,"landing_page_url":"https://doaj.org/article/33bfc6d6bc1c46358e0296ebc30b8320","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 13, Pp 188630-188649 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2025.3626029","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3626029","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8035579610","display_name":null,"funder_award_id":"IMSIU-DDRSP2504","funder_id":"https://openalex.org/F2666706692","funder_display_name":"Deanship of Scientific Research, Imam Mohammed Ibn Saud Islamic University"}],"funders":[{"id":"https://openalex.org/F2666706692","display_name":"Deanship of Scientific Research, Imam Mohammed Ibn Saud Islamic University","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Minimum":[0],"Weight":[1],"Triangulation":[2],"(MWT)":[3],"of":[4,153],"convex":[5,142],"polygons":[6,143],"is":[7],"a":[8,55,101,108,195],"cornerstone":[9],"problem":[10],"in":[11,16,63,133,223],"computational":[12,225],"geometry":[13,226],"with":[14,88,202],"applications":[15],"mesh":[17],"generation,":[18],"terrain":[19],"modeling,":[20],"computer":[21],"vision,":[22],"and":[23,77,92,99,112,118,160,168,174],"geographic":[24],"information":[25],"systems.":[26],"Traditional":[27],"dynamic":[28],"programming":[29],"approaches":[30],"solve":[31],"MWT":[32,62],"exactly":[33],"but":[34],"incur":[35],"prohibitive":[36],"<italic":[37,65,183],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[38,40,42,66,68,171,184],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">O</i>(<italic":[39,67],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</i><sup":[41],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3</sup>)":[43],"time":[44,70],"complexity,":[45],"limiting":[46],"their":[47],"scalability":[48,177],"for":[49,182,199,213,220],"large":[50],"polygons.":[51],"This":[52,207],"paper":[53],"introduces":[54],"novel":[56],"greedy":[57],"algorithm":[58],"that":[59,115,124],"achieves":[60],"optimal":[61,154],"linear":[64],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</i>)":[69],"by":[71,128,163],"starting":[72],"from":[73],"the":[74,80,218],"shortest":[75],"edge":[76],"iteratively":[78],"selecting":[79],"minimal":[81],"diagonal":[82],"among":[83],"four":[84],"consecutive":[85],"vertices,":[86],"enhanced":[87],"directional":[89,121],"optimization":[90],"(clockwise":[91],"anticlockwise":[93],"traversals)":[94],"to":[95,130,145,189],"exploit":[96],"geometric":[97,215],"configurations":[98],"yield":[100],"superior":[102],"result.":[103],"Our":[104],"contributions":[105],"include:":[106],"(i)":[107],"mathematically":[109],"rigorous":[110],"formulation":[111],"proof-of-concept":[113],"implementation":[114],"balances":[116],"efficiency":[117],"accuracy;":[119],"(ii)":[120],"traversal":[122],"strategies":[123],"improve":[125],"solution":[126],"quality":[127],"up":[129],"10":[131],"%":[132,152,167],"tested":[134],"cases;":[135],"(iii)":[136],"comprehensive":[137],"experimental":[138],"validation":[139],"on":[140],"diverse":[141],"(4":[144],"15":[146],"vertices),":[147],"demonstrating":[148],"weights":[149],"within":[150],"3:5":[151],"DP":[155],"solutions":[156],"while":[157],"outperforming":[158],"quasi-greedy":[159],"Delaunay":[161],"methods":[162,222],"20":[164],"\u2013":[165],"30":[166],"over":[169],"10<italic":[170],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">x</i>,":[172],"respectively;":[173],"(iv)":[175],"runtime":[176],"analysis":[178],"showing":[179],"orders-of-magnitude":[180],"speedups":[181],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</i>":[185],"\u2265":[186],"50.":[187],"Compared":[188],"state-of-the-art":[190],"methods,":[191],"our":[192],"approach":[193],"offers":[194],"practical,":[196],"lightweight":[197],"alternative":[198],"real-time":[200],"applications,":[201],"code":[203],"available":[204],"at":[205],"https://github.com/drmasifhabib/MWT_Greedy_Algorithm.":[206],"work":[208],"advances":[209],"efficient":[210],"approximation":[211],"algorithms":[212],"NP-hard":[214],"optimization,":[216],"paving":[217],"way":[219],"hybrid":[221],"largescale":[224],"tasks.":[227]},"counts_by_year":[],"updated_date":"2025-11-08T23:21:52.890332","created_date":"2025-10-28T00:00:00"}