{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:27:28Z","timestamp":1760149648997,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T00:00:00Z","timestamp":1693094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>With the function RooTri(), we present a simple and robust calculation method for the approximation of the intersection points of a scalar field given as an unstructured point cloud with a plane oriented arbitrarily in space. The point cloud is approximated to a surface consisting of triangles whose edges are used for computing the intersection points. The function contourc() of Matlab is taken as a reference. Our experiments show that the function contourc() produces outliers that deviate significantly from the defined nominal value, while the quality of the results produced by the function RooTri() increases with finer resolution of the examined grid.<\/jats:p>","DOI":"10.3390\/a16090409","type":"journal-article","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T05:46:47Z","timestamp":1693201607000},"page":"409","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["RooTri: A Simple and Robust Function to Approximate the Intersection Points of a 3D Scalar Field with an Arbitrarily Oriented Plane in MATLAB"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1379-2110","authenticated-orcid":false,"given":"Jan","family":"Oellerich","sequence":"first","affiliation":[{"name":"Institute for Material Handling and Logistics (IFL), Karlsruhe Institute of Technology (KIT), Kaiserstrasse 12, 76131 Karlsruhe, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1816-9237","authenticated-orcid":false,"given":"Keno Jann","family":"B\u00fcscher","sequence":"additional","affiliation":[{"name":"Institute for Material Handling and Logistics (IFL), Karlsruhe Institute of Technology (KIT), Kaiserstrasse 12, 76131 Karlsruhe, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6429-8219","authenticated-orcid":false,"given":"Jan Philipp","family":"Degel","sequence":"additional","affiliation":[{"name":"Institute of Sustainable Energy Systems, Offenburg University of Applied Sciences, Badstra\u00dfe 24, 77652 Offenburg, Germany"}]}],"member":"1968","published-online":{"date-parts":[[2023,8,27]]},"reference":[{"unstructured":"Quarteroni, A., Sacco, R., and Saleri, F. (2010). Numerical Mathematics, Springer. [2nd ed.]. Texts in Applied Mathematics.","key":"ref_1"},{"doi-asserted-by":"crossref","unstructured":"Ryaben\u2019kii, V., and Tsynkov, S. (2006). A Theoretical Introduction to Numerical Analysis, Taylor & Francis. [1st ed.].","key":"ref_2","DOI":"10.1201\/9781420011166"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1093\/comjnl\/14.4.422","article-title":"An algorithm with guaranteed convergence for finding a zero of a function","volume":"14","author":"Brent","year":"1971","journal-title":"Comput. J."},{"key":"ref_4","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":"SIGGRAPH Comput. Graph."},{"unstructured":"Maple, C. (2003, January 16\u201318). Geometric design and space planning using the marching squares and marching cube algorithms. Proceedings of the 2003 International Conference on Geometric Modeling and Graphics, London, UK.","key":"ref_5"},{"doi-asserted-by":"crossref","unstructured":"Sin, Z.P.T., and Ng, P.H.F. (2018, January 29\u201331). Planetary Marching Cubes: A Marching Cubes Algorithm for Spherical Space. Proceedings of the 2018 2nd International Conference on Video and Image Processing, Hong Kong, China.","key":"ref_6","DOI":"10.1145\/3301506.3301522"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1186\/s13173-019-0086-6","article-title":"An extended triangulation to the Marching Cubes 33 algorithm","volume":"25","author":"Custodio","year":"2019","journal-title":"J. Braz. Comput. Soc."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.vrih.2021.08.006","article-title":"A marching cube algorithm based on edge growth","volume":"3","author":"Wang","year":"2021","journal-title":"Virtual Real. Intell. Hardw."},{"unstructured":"Nielson, G., and Hamann, B. (1991, January 22\u201325). The asymptotic decider: Resolving the ambiguity in marching cubes. Proceedings of the Visualization \u201991, San Diego, CA, USA.","key":"ref_9"},{"doi-asserted-by":"crossref","unstructured":"Grosso, R. (2017, January 27\u201330). An Asymptotic Decider for Robust and Topologically Correct Triangulation of Isosurfaces: Topologically Correct Isosurfaces. Proceedings of the CGI \u201917 Computer Graphics International Conference, Yokohama, Japan.","key":"ref_10","DOI":"10.1145\/3095140.3095179"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1109\/TVCG.2018.2864505","article-title":"Probabilistic Asymptotic Decider for Topological Ambiguity Resolution in Level-Set Extraction for Uncertain 2D Data","volume":"25","author":"Athawale","year":"2019","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/99308.99321","article-title":"Octrees for Faster Isosurface Generation","volume":"24","author":"Wilhelms","year":"1990","journal-title":"SIGGRAPH Comput. Graph."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/2945.489388","article-title":"A near optimal isosurface extraction algorithm using the span space","volume":"2","author":"Livnat","year":"1996","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"unstructured":"Redfern, D., and Campbell, C. (2012). The Matlab\u00ae 5 Handbook, Springer.","key":"ref_14"},{"doi-asserted-by":"crossref","unstructured":"Demirkaya, O., Asyali, M., and Sahoo, P. (2008). Image Processing with MATLAB: Applications in Medicine and Biology, CRC Press.","key":"ref_15","DOI":"10.1201\/9781420008937"},{"doi-asserted-by":"crossref","unstructured":"Mukhopadhyay, M., and Sheikh, A. (2022). Matrix and Finite Element Analyses of Structures, Springer International Publishing. [1st ed.].","key":"ref_16","DOI":"10.1007\/978-3-031-08724-0"},{"doi-asserted-by":"crossref","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., and Overmars, M. (2008). Computational Geometry: Algorithms and Applications, Springer. [3rd ed.].","key":"ref_17","DOI":"10.1007\/978-3-540-77974-2"},{"doi-asserted-by":"crossref","unstructured":"Santner, T., Williams, B., and Notz, W. (2019). The Design and Analysis of Computer Experiments, Springer. [2nd ed.].","key":"ref_18","DOI":"10.1007\/978-1-4939-8847-1"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1198\/TECH.2009.08040","article-title":"Choosing the Sample Size of a Computer Experiment: A Practical Guide","volume":"51","author":"Loeppky","year":"2009","journal-title":"Technometrics"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1162\/evco.2006.14.1.119","article-title":"A Note on the Extended Rosenbrock Function","volume":"14","author":"Shang","year":"2006","journal-title":"Evol. Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.ijepes.2013.08.011","article-title":"Analysis of optimal power flow problem based on two stage initialization algorithm","volume":"55","author":"Ramana","year":"2014","journal-title":"Int. J. Electr. Power Energy Syst."},{"doi-asserted-by":"crossref","unstructured":"Degel, J.P., Gullone, G., Doppelbauer, M., Kl\u00f6ffer, C., and Wondrak, W. (2019, January 3\u20135). A Novel Approach of High Dynamic Current Control of Interior Permanent Magnet Synchronous Machines. Proceedings of the 2019 21st European Conference on Power Electronics and Applications (EPE \u201919 ECCE Europe), Genova, Italy.","key":"ref_22","DOI":"10.23919\/EPE.2019.8915058"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"113829","DOI":"10.1016\/j.cma.2021.113829","article-title":"A Reaction Diffusion-based Level Set Method Using Body-fitted Mesh for Structural Topology Optimization","volume":"381","author":"Zhuang","year":"2021","journal-title":"Comput. Methods Appl. Mech. Eng."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/9\/409\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:40:21Z","timestamp":1760128821000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/9\/409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,27]]},"references-count":23,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2023,9]]}},"alternative-id":["a16090409"],"URL":"https:\/\/doi.org\/10.3390\/a16090409","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,8,27]]}}}