{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T04:24:32Z","timestamp":1772252672707,"version":"3.50.1"},"reference-count":27,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2020,11,15]],"date-time":"2020-11-15T00:00:00Z","timestamp":1605398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>This article presents the Base Point Split (BPSplit) algorithm to generate a complex polygon skeleton based on sets of vector data describing lakes and rivers. A key feature of the BPSplit algorithm is that it is dependent on base points representing the source or mouth of a river or a stream. The input values of base points determine the shape of the resulting skeleton of complex polygons. Various skeletons can be generated with the use of different base points. Base points are applied to divide complex polygon boundaries into segments. Segmentation supports the selection of triangulated irregular network (TIN) edges inside complex polygons. The midpoints of the selected TIN edges constitute a basis for generating a skeleton. The algorithm handles complex polygons with numerous holes, and it accounts for all holes. This article proposes a method for modifying a complex skeleton with numerous holes. In the discussed approach, skeleton edges that do not meet the preset criteria (e.g., that the skeleton is to be located between holes in the center of the polygon) are automatically removed. An algorithm for smoothing zigzag lines was proposed.<\/jats:p>","DOI":"10.3390\/ijgi9110680","type":"journal-article","created":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T11:04:20Z","timestamp":1605524660000},"page":"680","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Base Point Split Algorithm for Generating Polygon Skeleton Lines on the Example of Lakes"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8847-2835","authenticated-orcid":false,"given":"El\u017cbieta","family":"Lewandowicz","sequence":"first","affiliation":[{"name":"Department of Geoinformation and Cartography, Institute of Geodesy and Civil Engineering, Faculty of Geoengineering, University Warmia and Mazury in Olsztyn, 10-719 Olsztyn, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2922-5839","authenticated-orcid":false,"given":"Pawe\u0142","family":"Flisek","sequence":"additional","affiliation":[{"name":"Department of Geoinformation and Cartography, Institute of Geodesy and Civil Engineering, Faculty of Geoengineering, University Warmia and Mazury in Olsztyn, 10-719 Olsztyn, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,11,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TPAMI.1982.4767267","article-title":"Medial Axis Transformation of a Planar Shape","volume":"4","author":"Lee","year":"1982","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Chin, F., Snoeyink, J., and Wang, C.A. (1995). Finding the Medial Axis of a Simple Polygon in Linear Time. International Symposium on Algorithms and Computation, Springer.","DOI":"10.1007\/BFb0015444"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.cageo.2013.06.004","article-title":"Watershed delineation from the medial axis of river networks","volume":"59","author":"Karimipour","year":"2013","journal-title":"Comput. Geosci."},{"key":"ref_4","first-page":"1","article-title":"Morphological Analysis of Shapes","volume":"139","author":"Prasad","year":"1997","journal-title":"CNLS Newsl."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/PL00009479","article-title":"Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions","volume":"22","author":"Eppstein","year":"1999","journal-title":"Discret. Comput. Geom."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Richardson, D., Castree, N., Goodchild, M.F., Kobayashi, A., Liu, W., and Marston, R.A. (2017). Spatial modeling: Voronoi diagrams. International Encyclopedia of Geography: People, the Earth, Environment and Technology, Wiley.","DOI":"10.1002\/9781118786352"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Li, C., Yin, Y., Wu, P., and Wu, W. (2020). Pattern recognition and correction method for skeleton lines at small patch boundaries. Trans. GIS.","DOI":"10.1111\/tgis.12643"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1111\/tgis.12523","article-title":"A method for the extraction of partition lines from long and narrow patches that account for structural features","volume":"23","author":"Li","year":"2019","journal-title":"Trans. GIS"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1080\/13658816.2016.1197399","article-title":"Envelope generation and simplification of polylines using Delaunay triangulation","volume":"31","author":"Ai","year":"2016","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1522","DOI":"10.1080\/13658816.2016.1140770","article-title":"SPLITAREA: An algorithm for weighted splitting of faces in the context of a planar partition","volume":"30","author":"Meijers","year":"2016","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Meijers, M. (2011). Variable-Scale Geo-Information, Nederlandse Commissie voor Geodesie, Netherlands Geodetic Commission.","DOI":"10.54419\/r2gjph"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ipl.2014.08.006","article-title":"On triangulation axes of polygons","volume":"115","author":"Aigner","year":"2015","journal-title":"Inf. Process. Lett."},{"key":"ref_13","unstructured":"Wang, Z., and Yan, H. (2011, January 9\u201311). An algorithm for extracting main skeleton lines of polygons based on main extension directions. Proceedings of the 2011 International Conference on Electronics, Communications and Control (ICECC), Ningbo, China."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Lewandowicz, E., and Flisek, P. (2020). A Method for Generating the Centerline of an Elongated Polygon on the Example of a Watercourse. ISPRS Int. J. Geo-Inf., 9.","DOI":"10.3390\/ijgi9050304"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Li, C., Yin, Y., Wu, P., Liu, X., and Guo, P. (2018). Improved Jitter Elimination and Topology Correction Method for the Split Line of Narrow and Long Patches. ISPRS Int. J. Geo-Inf., 7.","DOI":"10.3390\/ijgi7100402"},{"key":"ref_16","first-page":"272","article-title":"Extraction of optimal skeleton of polygon based on hierarchical analysis","volume":"28","author":"Wang","year":"2009","journal-title":"Int. Arch. Photogramm. Remote Sens. Spat. Inf. Sci."},{"key":"ref_17","unstructured":"Giesen, J., Miklos, B., and Pauly, M. (2007, January 20\u201322). Medial axis approximation of planar shapes from union of balls: A simpler and more robust algorithm. Proceedings of the Canadian Conference Computational Geometry, Ottawa, ON, Ontario."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Giesen, J., Miklos, B., Pauly, M., and Wormser, C. (2009, January 8\u201310). The scale axis transform. Proceedings of the 25th Annual Symposium on Computational Geometry, Aarhus, Denmark.","DOI":"10.1145\/1542362.1542388"},{"key":"ref_19","unstructured":"Haunert, J.H., and Sester, M. (2004, January 20\u201321). Using the straight skeleton for generalization in a multiple representation environment. Proceedings of the ICA Workshop on Generalization and Multiple Representation, Leicester, UK."},{"key":"ref_20","first-page":"85","article-title":"Comparison of methods used in cartography for the skeletonisation of areal objects","volume":"14","author":"Szombara","year":"2015","journal-title":"Geoinf. Pol."},{"key":"ref_21","unstructured":"(2020, November 12). ESRI 2020, ArcGIS. Available online: https:\/\/www.esri.pl\/."},{"key":"ref_22","unstructured":"ESRI (2020, November 12). Tool: Creates Centerlines from Polygon Features. Available online: https:\/\/pro.arcgis.com\/en\/pro-app\/tool-reference\/topographic-production\/polygon-to-centerline.htm."},{"key":"ref_23","first-page":"112","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":"Cartogr. Int. J. Geogr. Inf. Geovis."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1080\/02693799208901921","article-title":"Algorithms for automated line generalization based on a natural principle of objective generalization","volume":"6","author":"Li","year":"1992","journal-title":"Int. J. Geogr. Inf. Syst."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Qian, H., Zhang, M., and Wu, F. (2016). A New Simplification Approach Based on the Oblique-Dividing-Curve Method for Contour Lines. ISPRS Int. J. Geo-Inf., 5.","DOI":"10.3390\/ijgi5090153"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1179\/000870406X93490","article-title":"Performance Evaluation of Line Simplification Algorithms for Vector Generalization","volume":"43","author":"Shi","year":"2006","journal-title":"Cartogr. J."},{"key":"ref_27","first-page":"169","article-title":"Znaczenie punkt\u00f3w sta\u0142ych obiektu w procesie upraszczania (The importance of fixed points in the simplification proces)","volume":"23","year":"2012","journal-title":"Archiwum Fotogrametrii, Kartografii i Teledetekcji"}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/9\/11\/680\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:33:44Z","timestamp":1760178824000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/9\/11\/680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,15]]},"references-count":27,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2020,11]]}},"alternative-id":["ijgi9110680"],"URL":"https:\/\/doi.org\/10.3390\/ijgi9110680","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints202009.0721.v1","asserted-by":"object"}]},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,15]]}}}