Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "binary structure" wg kryterium: Temat


Wyświetlanie 1-2 z 2
Tytuł:
Algorithm of automatic digital cartographic generalisation with the use of contractive self-mapping
Autorzy:
Banasik, Piotr
Chrobak, Tadeusz
Biegun, Bartosz
Powiązania:
https://bibliotekanauki.pl/articles/2044551.pdf
Data publikacji:
2022-04-05
Wydawca:
Oddział Kartograficzny Polskiego Towarzystwa Geograficznego
Tematy:
digital generalisation
contractive self-mapping
minimum dimensions of Salishchev
polyline (segmented line) of binary tree structure
contraction triangles
Opis:
The research of modern cartography in the field of digital generalisation focuses on the develop ment 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.
Źródło:
Polish Cartographical Review; 2022, 54, 1; 1-10
2450-6974
Pojawia się w:
Polish Cartographical Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Automatic simplification of the geometry of a cartographic line using contractive self-mapping – illustrated with an example of a polyline band
Autorzy:
Bac-Bronowicz, Joanna
Banasik, Piotr
Chrobak, Tadeusz
Powiązania:
https://bibliotekanauki.pl/articles/29433667.pdf
Data publikacji:
2023-12-07
Wydawca:
Oddział Kartograficzny Polskiego Towarzystwa Geograficznego
Tematy:
digital generalization
contractive self-mapping
Salichtchev’s minimum measures
geometry of a polyline in the binary tree structure
Lipschitz’s contraction triangle
Banach theorem
Opis:
The present article is another attempt to adapt map geometry to automatic digital cartography. The paper presents a method of digital polyline generalisation that uses contractive self-mapping. It is a method of simplification, not just an algorithm for simplification. This method in its 1996 version obtained a patent entitled “Method of Eliminating Points in the Process of Numerical Cartographic Generalisation” – Patent Office of the Republic of Poland, No. 181014, 1996. The first results of research conducted using the presented method, with clearly defined data (without singular points of their geometry), were published in the works of the authors in 2021 and 2022. This article presents a transition from the DLM (Digital Landscape Model) to the DCM (Digital Cartographic Model). It demonstrates an algorithm with independent solutions for the band axis and both its edges. The presented example was performed for the so-called polyline band, which can represent real topographic linear objects such as rivers and boundaries of closed areas (buildings, lakes, etc.). An unambiguous representation of both edges of the band is its axis, represented in DLM, which can be simplified to any scale. A direct consequence of this simplification is the shape of the band representing the actual shape of both edges of the object that is classified in the database as a linear object in DCM. The article presents an example performed for the so-called polyline band, which represents real topographic linear objects (roads, rivers) and area boundaries. The proposed method fulfils the following conditions: the Lipschitz condition, the Cauchy condition, the Banach theorem, and the Salichtchev’s standard for object recognition on the map. The presented method is objective in contrast to the previously used approximate methods, such as generalisations that use graph theory and fractal geometry, line smoothing and simplification algorithms, statistical methods with classification of object attributes, artificial intelligence, etc. The presented method for changing the geometry of objects by any scale of the map is 100% automatic, repeatable, and objective; that is, it does not require a cartographer’s intervention.
Źródło:
Polish Cartographical Review; 2023, 55, 1; 73-86
2450-6974
Pojawia się w:
Polish Cartographical Review
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies