{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T20:38:46Z","timestamp":1770669526386,"version":"3.49.0"},"reference-count":44,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T00:00:00Z","timestamp":1686009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Slovene Research Agency","doi-asserted-by":"publisher","award":["N2-0181"],"award-info":[{"award-number":["N2-0181"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Slovene Research Agency","doi-asserted-by":"publisher","award":["P2-0041"],"award-info":[{"award-number":["P2-0041"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Slovene Research Agency","doi-asserted-by":"publisher","award":["21-08009K"],"award-info":[{"award-number":["21-08009K"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"publisher","award":["N2-0181"],"award-info":[{"award-number":["N2-0181"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"publisher","award":["P2-0041"],"award-info":[{"award-number":["P2-0041"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"publisher","award":["21-08009K"],"award-info":[{"award-number":["21-08009K"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The characterisation of geometric shapes produces their concise description and is, therefore, important for subsequent analyses, for example in Computer Vision, Machine Learning, or shape matching. A new method for extracting characterisation vectors of 2D geometric shapes is proposed in this paper. The shape of interest, embedded into a raster space, is swept several times by sweep-lines having different slopes. The interior shape\u2019s points, being in the middle of its boundary and laying on the actual sweep-line, are identified at each stage of the sweeping process. The midpoints are then connected iteratively into chains. The chains are filtered, vectorised, and normalised. The obtained polylines from the vectorisation step are used to design the shape\u2019s characterisation vector for further application-specific analyses. The proposed method was verified on numerous shapes, where single- and multi-threaded implementations were compared. Finally, characterisation vectors, among which some were rotated and scaled, were determined for these shapes. The proposed method demonstrated a good rotation- and scaling-invariant identification of equal shapes.<\/jats:p>","DOI":"10.3390\/sym15061212","type":"journal-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T01:38:41Z","timestamp":1686101921000},"page":"1212","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Geometric Shape Characterisation Based on a Multi-Sweeping Paradigm"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4372-5020","authenticated-orcid":false,"given":"Borut","family":"\u017dalik\u00a0","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka cesta 46, SI-2000 Maribor, Slovenia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4468-0290","authenticated-orcid":false,"given":"Damjan","family":"Strnad\u00a0","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka cesta 46, SI-2000 Maribor, Slovenia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0701-9201","authenticated-orcid":false,"given":"David","family":"Podgorelec\u00a0","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka cesta 46, SI-2000 Maribor, Slovenia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4556-2771","authenticated-orcid":false,"given":"Ivana","family":"Kolingerov\u00e1\u00a0","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of West Bohemia, Technick\u00e1 8, 306 14 Plze\u0148, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1559-9776","authenticated-orcid":false,"given":"Andrej","family":"Nerat\u00a0","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka cesta 46, SI-2000 Maribor, Slovenia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9517-1157","authenticated-orcid":false,"given":"Niko","family":"Luka\u010d\u00a0","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka cesta 46, SI-2000 Maribor, Slovenia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6210-0889","authenticated-orcid":false,"given":"\u0160tefan","family":"Kohek\u00a0","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka cesta 46, SI-2000 Maribor, Slovenia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4691-5401","authenticated-orcid":false,"given":"Luka","family":"Luka\u010d\u00a0","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, University of Maribor, Koro\u0161ka cesta 46, SI-2000 Maribor, Slovenia"}]}],"member":"1968","published-online":{"date-parts":[[2023,6,6]]},"reference":[{"key":"ref_1","unstructured":"Mortenson, M.E. (1985). Geometric Modeling, Wileys."},{"key":"ref_2","unstructured":"Hoffmann, C.M. (1989). Geometric and Solid Modeling: An Introduction, Morgan Kaufmann Pub."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Liu, H., and Motoda, H. (1998). Feature Selection for Knowledge Discovery and Data Minimg, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-5689-3"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., and Schwarzkopf, O. (1997). Computational Geometry: Algorithms and Applications, Springer.","DOI":"10.1007\/978-3-662-03427-9"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Shamos, M.I., and Hoey, D. (1976, January 25\u201327). Geometric intersection problems. Proceedings of the 17th Annual Symposium on Foundations of Computer Science (SFCS 1976), Houston, TX, USA.","DOI":"10.1109\/SFCS.1976.16"},{"key":"ref_6","unstructured":"Ferreira, C.R., Andrade, M.V.A., Magalhes, S.V.G., Franklin, W.R., and Pena, G.C. (2013, January 24\u201327). A Parallel Sweep Line Algorithm for Visibility Computation. Proceedings of the XIV GEOINFO, Campos do Jord\u00e3o, Brazil."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF03167502","article-title":"A sweep-line algorithm for the inclusion hierarchy among circles","volume":"23","author":"Kim","year":"2006","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/S0097-8493(03)00151-1","article-title":"Polygon trapezoidation by sets of open trapezoids","volume":"27","author":"Jezernik","year":"2003","journal-title":"Comput. Graph-UK"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.advengsoft.2008.06.003","article-title":"A sweep-line algorithm for spatial clustering","volume":"40","year":"2009","journal-title":"Adv. Eng. Softw."},{"key":"ref_10","first-page":"564","article-title":"Sweep-hyperplane clustering algorithm using dynamic model","volume":"25","year":"2014","journal-title":"Informatica"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1080\/13658810701492241","article-title":"Sweep-line algorithm for constrained Delaunay triangulation","volume":"22","author":"Domiter","year":"2008","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1016\/j.cad.2004.10.004","article-title":"An efficient sweep-line Delaunay triangulation algorithm","volume":"37","year":"2005","journal-title":"Comput. Aided Des."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","article-title":"A sweepline algorithm for Voronoi diagrams","volume":"2","author":"Fortune","year":"1987","journal-title":"Algorithmica"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1080\/13658810801909607","article-title":"Determining directional distances between points and shorelines using sweep-line technique","volume":"23","author":"Nevalainen","year":"2009","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0146-664X(78)90115-6","article-title":"A review of algorithms for shape analysis","volume":"7","author":"Pavlidis","year":"1978","journal-title":"Comput. Graph. Image Process."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/S0031-2023(97)00122-2","article-title":"A survey of shape analysis techniques","volume":"31","author":"Loncaric","year":"1998","journal-title":"Pattern Recogn."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.isprsjprs.2019.02.009","article-title":"Segmentation for Object-Based Image Analysis (OBIA) a review of algorithms and challenges from remote sensing perspective","volume":"150","author":"Hossain","year":"2019","journal-title":"ISPRS J. Photogramm."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Burger, W., and Burge, M.J. (2009). Principles of Digital Image Processing, Springer.","DOI":"10.1007\/978-1-84800-191-6"},{"key":"ref_19","unstructured":"Solomon, C., and Brekon, T. (2011). Fundamentals of Digital Image Processing, Wiley-Blackwell."},{"key":"ref_20","unstructured":"Gonzales, R., and Woods, R. (2017). Digital Image Processing, Pearson Prentice Hall."},{"key":"ref_21","unstructured":"Wathen-Dunn, W. (1967). Models for the Perception of Speech and Visual Form, MIT Press."},{"key":"ref_22","unstructured":"Bebis, G., Li, B., Yao, A., Liu, Y., Duan, Y., Lau, M., Khadka, R., Crisan, A., and Chang, R. (2014). Advances in Visual Computing, Proceedings of the 10th International Symposium, ISVC 2014, Las Vegas, NV, USA, 8\u201310 December 2014, Springer."},{"key":"ref_23","first-page":"752","article-title":"A novel type of skeleton for polygons","volume":"1","author":"Aichholzer","year":"1995","journal-title":"J. Univers. Comput. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Cai, J.-Y., and Wong, C.K. (1996, January 17\u201319). Straight skeletons for general polygonal figures in the plane. Proceedings of the Annual International Conference on Computing and Combinatorics (COCOON\u201996), Hong Kong. Lecture Notes in Computer Science 1090.","DOI":"10.1007\/3-540-61332-3"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.advengsoft.2012.05.006","article-title":"A fast algorithm for constructing approximate medial axis of polygons, using Steiner points","volume":"52","author":"Smogavec","year":"2012","journal-title":"Adv. Eng. Softw."},{"key":"ref_26","unstructured":"Hershberger, J., and Fogel, E. (2009, January 8\u201310). The Scale Axis Transform. Proceedings of the Twenty-Fifth Annual Symposium on Computational Geometry (SCG\u201909), Aarhus, Denmark."},{"key":"ref_27","first-page":"217","article-title":"A framework for computational morphology","volume":"Volume 2","author":"Toussaint","year":"1985","journal-title":"Computational Geometry, Machine Intelligence and Pattern Recognition"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/j.cviu.2007.09.013","article-title":"Strategies for shape matching using skeletons","volume":"110","author":"Goh","year":"2008","journal-title":"Comput. Vis. Image Underst."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Ma, C., Zhang, S., Wang, A., Qi, Y., and Chen, G. (2020). Skeleton-Based Dynamic Hand Gesture Recognition Using an Enhanced Network with One-Shot Learning. Appl. Sci., 10.","DOI":"10.3390\/app10113680"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1586","DOI":"10.1109\/TIP.2017.2785279","article-title":"Skeleton-based Human Action Recognition with Global Context-Aware Attention LSTM Networks","volume":"27","author":"Liu","year":"2018","journal-title":"IEEE Trans. Image Process."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Tasnim, N., Islam, M.M., and Baek, J.-H. (2020). Deep Learning-Based Action Recognition Using 3D Skeleton Joints Information. Inventions, 5.","DOI":"10.3390\/inventions5030049"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Papadopoulos, K., Demisse, G., Ghorbel, E., Antunes, M., Aouada, D., and Ottersten, B. (2019). Localized trajectories for 2D and 3D action recognition. Sensors, 19.","DOI":"10.3390\/s19163503"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Wang, C. (2020). Research on the Detection Method of Implicit Self Symmetry in a High-Level Semantic Model. Symmetry, 12.","DOI":"10.3390\/sym12010028"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s11883-019-0766-x","article-title":"Rheumatoid arthritis: Atherosclerosis imaging and cardiovascular risk assessment using machine and deep learning-based tissue characterization","volume":"21","author":"Khanna","year":"2019","journal-title":"Curr. Atheroscler. Rep."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"e210110","DOI":"10.1148\/ryai.210110","article-title":"Deep learning for the detection, localization, and characterization of focal liver lesions on abdominal US images","volume":"4","author":"Dadoun","year":"2022","journal-title":"Radiol. Artif. Intell."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.isprsjprs.2019.02.010","article-title":"A graph convolutional neural network for classification of building patterns using spatial vector data","volume":"150","author":"Yan","year":"2019","journal-title":"ISPRS J. Photogramm. Remote Sens."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"2307","DOI":"10.1007\/s10845-022-01926-z","article-title":"Image-based characterization of laser scribing quality using transfer learning","volume":"34","author":"Bisheh","year":"2022","journal-title":"J. Intell. Manuf."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TEC.1961.5219197","article-title":"On the encoding of arbitrary geometric configurations","volume":"EC10","author":"Freeman","year":"1961","journal-title":"IRE Trans. Electron. Comput."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0031-3203(98)00132-0","article-title":"A new chain code","volume":"32","author":"Bribiesca","year":"1999","journal-title":"Pattern Recogn."},{"key":"ref_40","first-page":"1","article-title":"Compressing bi-level images by means of a 3-bit chain code","volume":"44","year":"2005","journal-title":"Opt. Eng."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.jvcir.2016.03.001","article-title":"Unsigned Manhattan chain code","volume":"38","author":"Mongus","year":"2016","journal-title":"J. Vis. Commun. Image Represent."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01905559","article-title":"Analysis of an Algorithm for Fast Ray Tracing using Uniform Space Subdivision","volume":"4","author":"Cleary","year":"1988","journal-title":"Vis. Comput."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1111\/1467-8659.00128","article-title":"An Efficient Code-Based Voxel-Traversing Algorithm","volume":"16","author":"Clapworthy","year":"1997","journal-title":"Comput. Graph. Forum"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","article-title":"Algorithms for the reduction of the number of points required to represent a digitized line or its caricature","volume":"10","author":"Douglas","year":"1973","journal-title":"Cartographica"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/6\/1212\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:49:33Z","timestamp":1760125773000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/6\/1212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,6]]},"references-count":44,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["sym15061212"],"URL":"https:\/\/doi.org\/10.3390\/sym15061212","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,6]]}}}