Szczegóły publikacji
Opis bibliograficzny
Algorithm of automatic digital cartographic generalisation with the use of contractive self-mapping / Piotr BANASIK, Tadeusz Chrobak, Bartosz Biegun // Polish Cartographical Review ; ISSN 2450-6974. — 2022 — vol. 54 iss. 1, s. 1–10. — Bibliogr. s. 9–10, Abstr. — Publikacja dostępna online od: 2022-04-05
Autorzy (3)
- AGHBanasik Piotr
- Chrobak Tadeusz
- AGHBiegun Bartosz
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 139801 |
|---|---|
| Data dodania do BaDAP | 2022-04-12 |
| Tekst źródłowy | URL |
| DOI | 10.2478/pcr-2022-0001 |
| Rok publikacji | 2022 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Creative Commons | |
| Czasopismo/seria | Polish Cartographical Review |
Abstract
The research of modern cartography in the field of digital generalisation focuses on the development of such methods that would be fully automatic and give an unambiguously objective result. Devising them requires specific standards as well as unique and verifiable algorithms. In metric space, a proposal for such a method, based on contractive mapping, the Lipschitz and Cauchy conditions and the Banach theorem, using the Salishchev metric, was presented in the publication (Barańska et al., 2021). The method formulated there is dedicated to linear objects (polylines). The current work is a practical supplement to it. It presents the practical implementation of the algorithm for automatic and objective generalisation. The article describes an operational diagram of the subsequent stages of the proposed generalisation method. In the test example, a binary tree structure of an ordered polyline was created. It was simplified in two selected scales and its shape after generalisation was illustrated. The resulting polyline obtained by the fully automatic method was verified in terms of accuracy.
