{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T18:56:42Z","timestamp":1762801002151,"version":"build-2065373602"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University","award":["IMSIU-DDRSP2504"],"award-info":[{"award-number":["IMSIU-DDRSP2504"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3626029","type":"journal-article","created":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T17:35:26Z","timestamp":1761672926000},"page":"188630-188649","source":"Crossref","is-referenced-by-count":0,"title":["A Linear-Time Greedy Approach With Directional Optimization for Minimum Weight Triangulation of Convex Polygons"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2675-1975","authenticated-orcid":false,"given":"Muhammad","family":"Asif Habib","sequence":"first","affiliation":[{"name":"College of Computer and Information Sciences, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7214-0035","authenticated-orcid":false,"given":"Jabeen","family":"Sultana","sequence":"additional","affiliation":[{"name":"College of Computer and Information Sciences, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9158-7406","authenticated-orcid":false,"given":"Hamid","family":"Ali","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Textile University, Faisalabad, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naeem","family":"Raza","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National University of Modern Languages, Faisalabad, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmad","family":"Amad","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Textile University, Faisalabad, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2840-5096","authenticated-orcid":false,"given":"Hafiz","family":"Muhammad Sajid Imran","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Textile University, Faisalabad, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5912-2876","authenticated-orcid":false,"given":"Muhammad","family":"Abdul Qayum","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Textile University, Faisalabad, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6366-8230","authenticated-orcid":false,"given":"Mudassar","family":"Ahmad","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Textile University, Faisalabad, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Exact algorithms for minimum dilation triangulation","author":"Fekete","year":"2025","journal-title":"arXiv:2502.18189"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICECCME57830.2023.10252267"},{"volume-title":"Computers and Intractability: A Guide to Thetheory of NP-Completeness","year":"1979","author":"Garey","key":"ref3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1346330.1346336"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90005-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.11.006"},{"key":"ref7","article-title":"Matrix chain multiplication and polygon triangulation revisited and generalized","author":"Le","year":"2021","journal-title":"arXiv:2104.01777"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-48378-4_1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51859-2_15"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.7494\/csci.2018.19.3.2749"},{"issue":"1","key":"ref11","first-page":"3","article-title":"Parallel greedy triangulation of a point set","volume":"8","author":"Shoemaker","year":"2020","journal-title":"James Madison Undergraduate Res. J. (JMURJ)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19542-6_58"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-0761-4_30"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSA.2010.38"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/330560.330833"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90104-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1997.592370"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SCCC.2011.31"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056109"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2021.101794"},{"issue":"10","key":"ref21","first-page":"423","article-title":"Automatische interpolation von isolinien bei willk\u00fcrlichen st\u00fctzpunkten","volume":"77","author":"Duppe","year":"1970","journal-title":"Allgemeine Vermessungsnachrichten"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1975.8"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4947"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90020-4"},{"article-title":"New results on planar triangulations","year":"1979","author":"Gilbert","key":"ref25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/98524.98535"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/s0167-5060(08)70044-x"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574703"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.7494\/csci.2019.20.2.3193"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.22190\/FUMI1901137M"},{"article-title":"Optimal triangulation of polygons","year":"2021","author":"Bishop","key":"ref31"},{"key":"ref32","article-title":"Solving large-scale minimum-weight triangulation instances to provable optimality","author":"Haas","year":"2018","journal-title":"arXiv:1802.06415"},{"key":"ref33","first-page":"167","article-title":"Method for finding and storing optimal triangulations based on square matrix","volume":"20","author":"Saracevic","year":"2018","journal-title":"Appl. Sci. Electron. J."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0918"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.21"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90062-9"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/276884.276895"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11218828.pdf?arnumber=11218828","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T18:50:18Z","timestamp":1762800618000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11218828\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3626029","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}