Владислав Геннадьевич Горшков

Владислав Геннадьевич Горшков

Auto-generated profile, based on publicly available information

Владислав Геннадьевич Горшков

Demidov Yaroslavl State University, Yaroslavl, Russia

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 September 2022 in Modeling and Analysis of Information Systems
Verified
Journal Article
Open access
PDF file
ВГВладислав Геннадьевич Горшков
Владислав Геннадьевич Горшков
DMDmitriy M. Murin
Dmitriy M. Murin
OYOlga P. Yakimova
Olga P. Yakimova
In map production it is necessary to keep the spatial relationships between map objects. Generalization is the simplification performed on geographical data when decreasing its representation scale. It is a common practice to simplify each type of spatial objects independently (administrative boundaries first, then road network, hydrographic network, etc.). During the process some spatial conflicts, which require manual correction, arise inevitably. The generalization automation still remains an open issue for data producers and users. Many researchers are working to achieve a higher level of automation. In order to detect the spatial conflicts a refined description of spatial relationships is needed.The paper analyzes models of describing topological relationships of spatial objects: the nine intersections model, the topological chain model and the E-WID model. Each considered model allows to take into account some relations between objects, but does not allow to transfer them exactly. As a result, the task of developing a model of relations preserving topology is relevant. We have proposed an improved model of nine intersections, which takes into account the topological conflict that occurs when a point object is located next to a simplified line. Line simplification is one of the most requested actions in map production and generalization. When the mesh covered the map inside the cell there can be points, line segments and polygonal topological objects, which, if the cell is rather small, are polyline objects. Thus, the issue of simplification of topological objects within a cell is reduced to the issue of simplification of linear objects (polylines). The developed algorithm is planned to be used to solve the problem of consistent generalization of spatial data. The ideas outlined in this article will form the basis of a new index of spatial data that preserves their topological relationships.

1 December 2024 in Automatic Control and Computer Sciences
Verified
Journal Article
Closed access
PDF file
OYO. P. Yakimova
O. P. Yakimova
DMD. M. Murin
D. M. Murin
VGV. G. Gorshkov
V. G. Gorshkov
Cartographic generalization includes the selection of objects and phenomena, as well as their simplification (generalization), to be shown in the map while

1 December 2023 in Automatic Control and Computer Sciences
Verified
Journal Article
Closed access
PDF file
VGV. G. Gorshkov
V. G. Gorshkov
DMD. M. Murin
D. M. Murin
OYO. P. Yakimova
O. P. Yakimova
In map production it is necessary to keep the spatial relationships between map features. Generalization is simplification performed on geographical data w

1 November 2024
Verified
Conference Paper
Closed access
OYO.P. Yakimova
O.P. Yakimova
VGV.G. Gorshkov
V.G. Gorshkov
This paper puts forth a novel vector map descriptor, which is employed as a zero watermark for the purpose of safeguarding digital cartographic data from unauthorized reproduction and distribution. The descriptor is based on frequency analysis and comprises two variants: linear and matrix. This study investigates the stability of the proposed descriptor in the presence of various distortions to the vector map, including shifts, the addition of new objects, and the removal of points. In the course of the experimental studies, fragments of digital maps at three different scales (1:200,000, 1:50,000, and 1:100,000) were utilized. The two variants of the descriptor with different parameters were calculated for the aforementioned vector data, which was then subjected to an attack. Following this, the stability of the descriptor values was evaluated. The results of this research demonstrate that both variants of the proposed descriptor can be applied in practice for digital map copyright protection.

11 December 2023 in Modeling and Analysis of Information Systems
Verified
Journal Article
Open access
PDF file
OYOlga P. Yakimova
Olga P. Yakimova
ДМДмитрий Михайлович Мурин
Дмитрий Михайлович Мурин
ВГВладислав Геннадьевич Горшков
Владислав Геннадьевич Горшков
Cartographic generalization includes the process of graphically reducing information from reality or larger scaled maps to display only the information that is necessary at a specific scale. After generalization, maps can show the main things and essential characteristics. The scale, use and theme of maps, geographical features of cartographic regions and graphic dimensions of symbols are the main factors affecting cartographic generalization. Geometric simplification is one of the core components of cartographic generalization. The topological relations of spatial features also play an important role in spatial data organization, queries, updates, and quality control. Various map transformations can change the relationships between features, especially since it is common practice to simplify each type of spatial feature independently (first administrative boundaries, then road network, settlements, hydrographic network, etc.). In order to detect the spatial conflicts a refined description of topological relationships is needed. Considering coverings and mesh structures allows us to reduce the more general problem of topological conflict correction to the problem of resolving topological conflicts within a single mesh cell. In this paper, a new simplification algorithm is proposed. Its peculiarity is the joint simplification of a set of spatial objects of different types while preserving their topological relations. The proposed algorithm has a single parameter — the minimum map detail size (usually it is equal to one millimeter in the target map scale). The first step of the algorithm is the construction of a special mesh data structure. On its basis for each spatial object a sequence of cells is formed, to which points of this object belong. If a cell contains points of only one object, its geometric simplification is performed within the bounding cell using the sleeve-fitting algorithm. If a cell contains points of several objects, geometric simplification is performed using a special topology-preserving procedure.