{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T23:53:17Z","timestamp":1769730797239,"version":"3.49.0"},"reference-count":27,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T00:00:00Z","timestamp":1739404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>We propose a method for establishing a Constrained Delaunay Triangulation CDT applied to 2D binary images of high morphological complexity. A prerequisite for CDT is the unbiased definition of the Planar Straight-Line Graph PSLG, which must respect the injective nature of Jordan\u2019s Curve whatever the topology of the image objects. Mathematical morphology provides tools for extracting the image contour, on which points will be judiciously placed at particular points to construct the vector path of the PSLG. Finally, these tools will enable us to implement a judicious pointing process in the image to guarantee the relative equivalence of triangles. The deterministic and rigorous procedure detailed in this article will be generalized in a second article, Part 2, to the case of labeled images for which the definition of the PSLG is more complex to define, since the contour of objects in the image is defined by the set of contours of adjacent objects.<\/jats:p>","DOI":"10.3390\/computation13020052","type":"journal-article","created":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T05:10:22Z","timestamp":1739423422000},"page":"52","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unbiased Finite Element Mesh Delaunay Constrained Triangulation Applied to 2D Images with High Morphological Complexity Using Mathematical Morphology Tools Part 1: Binary Images"],"prefix":"10.3390","volume":"13","author":[{"given":"Franck","family":"N\u2019Guyen","sequence":"first","affiliation":[{"name":"Unit\u00e9 de M\u00e9canique de Lille UML J. Boussinesq, Universit\u00e9 de Lille, Villeneuve d\u2019Ascq, 59000 Lille, France"},{"name":"CMAT\u2014Centre des Mat\u00e9riaux, CNRS UMR 7633, Mines-Paris, PSL University, F-91003 Evry, France"}]},{"given":"Toufik","family":"Kanit","sequence":"additional","affiliation":[{"name":"Unit\u00e9 de M\u00e9canique de Lille UML J. Boussinesq, Universit\u00e9 de Lille, Villeneuve d\u2019Ascq, 59000 Lille, France"}]},{"given":"Abdellatif","family":"Imad","sequence":"additional","affiliation":[{"name":"Unit\u00e9 de M\u00e9canique de Lille UML J. Boussinesq, Universit\u00e9 de Lille, Villeneuve d\u2019Ascq, 59000 Lille, France"}]}],"member":"1968","published-online":{"date-parts":[[2025,2,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/5992.919261","article-title":"00f: An image-based finite-element analysis of material microstructures","volume":"3","author":"Langer","year":"2001","journal-title":"Comput. Sci. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.cma.2016.06.009","article-title":"Direct multiphase mesh generation from 3D images using anisotropic mesh adaptation and a redistancing equation","volume":"309","author":"Zhao","year":"2016","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/37402.37422","article-title":"Marching cubes: A high resolution 3D surface construction algorithm","volume":"21","author":"Lorensen","year":"1987","journal-title":"Comput. Graph."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"103303","DOI":"10.1016\/j.cad.2022.103303","article-title":"Computing the Intersection of Two Rational Surfaces Using Matrix Representations","volume":"150","author":"Jia","year":"2022","journal-title":"Comput.-Aided Des."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1682","DOI":"10.1016\/j.camwa.2014.03.001","article-title":"Adaptively weighted numerical integration over arbitrary domains","volume":"67","author":"Thiagarajan","year":"2014","journal-title":"Comput. Math. Appl."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Lin, M.C., and Manocha, D. (1996). Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. Applied Computational Geometry Towards Geometric Engineering, Springer.","DOI":"10.1007\/BFb0014474"},{"key":"ref_7","first-page":"49:1","article-title":"Restricted Constrained Delaunay Triangulations","volume":"Volume 189","author":"Buchin","year":"2021","journal-title":"Proceedings of the 37th International Symposium on Computational Geometry (SoCG 2021)"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0045-7825(96)01116-4","article-title":"3D mesh adaptation. Optimization of tetrahedral meshes by advancing front technique","volume":"141","author":"Rassineux","year":"1997","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"114740","DOI":"10.1016\/j.compstruct.2021.114740","article-title":"Robust conformal adaptive meshing of complex textile composites unit cells","volume":"279","author":"Rassineux","year":"2022","journal-title":"Compos. Struct."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.cad.2009.04.014","article-title":"Adaptive triangular-mesh reconstruction by mean-curvature-based refinement from point clouds using a moving parabolic approximation","volume":"42","author":"Yang","year":"2010","journal-title":"Comput.-Aided Des."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1145\/3533768","article-title":"Restricted Delaunay Triangulation for Explicit Surface Reconstruction","volume":"41","author":"Wang","year":"2022","journal-title":"ACM Trans. Graph."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2623","DOI":"10.1016\/j.camwa.2020.10.004","article-title":"A super-smooth C1 spline space over planar mixed triangle and quadrilateral meshes","volume":"80","author":"Kapl","year":"2020","journal-title":"Comput. Math. Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0898-1221(90)90347-M","article-title":"Generalized delaunay triangulations of non-convex domains","volume":"20","year":"1990","journal-title":"Comput. Math. Appl."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01553881","article-title":"Constrained delaunay triangulations","volume":"4","year":"1989","journal-title":"Algorithmica"},{"key":"ref_15","unstructured":"Lantuejoul, C. (2002). Geostatistical Simulation: Models and Algorithms, Springer. Collezione Legale Pirola."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.camwa.2017.09.041","article-title":"High-quality 2D mesh generation without obtuse and small angles","volume":"75","author":"Khan","year":"2018","journal-title":"Comput. Math. Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"102085","DOI":"10.1016\/j.cagd.2022.102085","article-title":"Angle-bounded 2D mesh simplificationImage 1","volume":"95","author":"Hinderink","year":"2022","journal-title":"Comput. Aided Geom. Des."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.disc.2018.10.002","article-title":"Identification of points using disks","volume":"342","author":"Gledel","year":"2019","journal-title":"Discret. Math."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"012006","DOI":"10.1088\/1742-6596\/1353\/1\/012006","article-title":"Determination of borders between objects on satellite images using a two-proof doubly stochastic filtration","volume":"1353","author":"Andriyanov","year":"2019","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Guaragnella, C., and Rizzi, M. (2020). Simple and Accurate Border Detection Algorithm for Melanoma Computer Aided Diagnosis. Diagnostics, 10.","DOI":"10.3390\/diagnostics10060423"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Lisowska, A. (2022). Efficient Edge Detection Method for Focused Images. Appl. Sci., 12.","DOI":"10.3390\/app122211668"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Soille, P. (1999). Morphological Image Analysis: Principles and Applications, Springer.","DOI":"10.1007\/978-3-662-03939-7"},{"key":"ref_23","unstructured":"Jordan, C. (1887). Cours d\u2019Analyse de l\u2019\u00c9cole Polytechnique, Cambridge University Press."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1109\/34.232073","article-title":"Comparing images using the Hausdorff distance","volume":"15","author":"Huttenlocher","year":"1993","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_25","unstructured":"Aspert, N., Santa-Cruz, D., and Ebrahimi, T. (2002, January 26\u201329). MESH: Measuring errors between surfaces using the Hausdorff distance. Proceedings of the 2002 IEEE International Conference on Multimedia and Expo, 2002. ICME \u201902. Proceedings, Lausanne, Switzerland."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Taubin, G. (1995, January 6\u201311). A signal processing approach to fair surface design. Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques, ACM, Los Angeles, CA, USA.","DOI":"10.1145\/218380.218473"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"102167","DOI":"10.1016\/j.cagd.2022.102167","article-title":"Generalized Savitzky\u2013Golay filter for smoothing triangular meshes","volume":"100","year":"2023","journal-title":"Comput. Aided Geom. Des."}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/13\/2\/52\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:32:40Z","timestamp":1760027560000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/13\/2\/52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,13]]},"references-count":27,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["computation13020052"],"URL":"https:\/\/doi.org\/10.3390\/computation13020052","relation":{},"ISSN":["2079-3197"],"issn-type":[{"value":"2079-3197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,13]]}}}