Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 1

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  polyline of binary tree structure
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
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.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.