Olga. P. Yakimova

Olga. P. Yakimova

Auto-generated profile, based on publicly available information

Olga. P. Yakimova

P. G. Demidov Yaroslavl State University

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
24 March 2017 in International Journal of Geographical Information Science
Verified
Journal Article
Closed access
Timofey SamsonovTimofey Samsonov
Timofey Samsonov
OYOlga. P. Yakimova
Olga. P. Yakimova
Line generalization is an essential data processing operation in geographic information systems and cartography. Many point reduction and simplification algorithms have been developed for this purpose. During the last three decades, several attempts have been made to develop approaches of generalization that adapt to the geometric properties of the processed lines. They typically incorporate line segmentation based on quantitative descriptions of the line shape. Little attention has been paid to the cases in which heterogeneous lines of different geometric character are mixed in one dataset. One common example is administrative borders, which often contain natural and artificial, smooth and sharp, schematic and non-schematic, and regular and irregular shapes. The tuning of the simplification algorithm based on a quantitative description of the shape would be ineffective here, since different algorithms must be applied to lines of different characters. In this article, we present a general method and generalization model for the simplification of such datasets. The properties of schematism, smoothness and regularity are used to differentiate various line characters. Three line characters, including irregular non-schematic, irregular schematic and regular orthogonal schematic, were selected for the current study. The developed generalization model consists of preprocessing, processing and postprocessing stages. Line segmentation based on the detection of different characters is performed during the preprocessing stage. Then, Li–Openshaw, Douglas–Peucker and orthogonal simplification are applied to the appropriate segments in the processing stage. Postprocessing enables the addition of extra regularity to the simplified shape. A visual and quantitative assessment of the results is provided and demonstrates the effectiveness of the developed approach in comparison with the global application of a single simplification algorithm.

29 July 2019 in International Journal of Cartography
Verified
Journal Article
Closed access
Timofey SamsonovTimofey Samsonov
Timofey Samsonov
OYOlga Yakimova
Olga Yakimova
One of the important stages of map generalization is the selection of optimal simplification procedure for each spatial feature or feature type. Selected algorithms are then applied collaboratively to simplify the whole set of features. However, there is a lack of investigations that report a systematic approach of deriving a similar reduction in accuracy and detail by using different algorithms. In current paper we propose the solution to this problem on the basis of regression modeling between tolerance value of each algorithm and the value of some geometric measure which describes changes in accuracy and detail of the line. This allows fitting the regression model between tolerance values of the two selected algorithms which can be used to obtain similar simplification results. Regressions between Douglas-Peucker, Li-Openshaw and Visvalingam-Whyatt algorithm tolerance values are investigated. Application of methodology is illustrated on the example of three coastlines with significantly different spatial character. Results of the study show that regression coefficients depend highly both on the combination of the two algorithms, and on the character of the line. Finally, it is shown that a weighted combination of accuracy and detail regression models can be used to model the changes in level of detail of the line.

16 November 2014 in Journal of Mathematical Sciences
Verified
Journal Article
Closed access
PDF file
VAV. V. Alexeev
V. V. Alexeev
VBV. G. Bogaevskaya
V. G. Bogaevskaya
MPM. M. Preobrazhenskaya
M. M. Preobrazhenskaya
AUA. Yu. Ukhalov
A. Yu. Ukhalov
HEHerbert Edelsbrunner
Herbert Edelsbrunner
OYO. P. Yakimova
O. P. Yakimova

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.

26 June 2024
Verified
Book Chapter
Closed access
PDF file
DID. A. Ignatenko
D. A. Ignatenko
NRN. A. Razvalov
N. A. Razvalov
OYO. P. Yakimova
O. P. Yakimova
ISI. E. Sidorina
I. E. Sidorina
AKA. V. Kochetova
A. V. Kochetova

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