Polygonal Objects Research Articles

MONITORING OF BOUNDARIES OF IMMOVABLE OBJECTS OF HISTORICAL AND CULTURAL HERITAGE BY CARTOMETRIC METHOD

Today, the most effective methods of studying polygonal objects of historical and cultural heritage are cartometric and remote (mainly based on the processing of remote sensing data). If necessary, also use archeology, but only after using the specified methods. This work presents the application of the cartometric method using GIS technologies on the example of determining the boundaries of Jewish cemeteries in the village of Gornostaypil, Kyiv region, which is located on the border of the Chernobyl thirty-kilometer exclusion zone, and in the village of Olyka, Volyn region. Today, the territory of the cemeteries is not used for burials, and in the Soviet period, in the village of Gornostaypil, it was built up with administrative and economic buildings, in the village of Olyka, partly by the private sector. Both archival and modern cartographic products and remote sensing data served as input data. Thus, all cartographic products are small-scale, due to the display of objects and the generalization of the border and area of cemeteries, they are displayed distorted, so their use is conditioned by the study of the dynamics of the elevation of cemeteries. To display the historical boundaries of objects in the modern urban planning picture, plans of cemeteries on a scale of 1:500 were created using geodetic methods using GNSS surveying.

Глобальное планирование маршрута мобильного робота на основе графовых методов

The problem of global route planning for a mobile robot between two given points in a known area with static obstacles is considered. To solve the problem of constructing a route in an area with a large number of obstacles of complex shape, an integrated approach based on graph theory methods is proposed. It includes the Voronoi diagram, visibility graph and the Dijkstra's algorithm. At the first stage, the study area is represented as a polygonal object, the space outside the object is considered as obstacles. Next, to get a safe distance from obstacles, an internal buffer of the polygonal object is built using the Minkowski difference. Then the vertices of the polygon are compacted, and the Voronoi polygons are constructed from the resulting vertices. The median axis of the polygon is calculated from the Voronoi polygons. Then the Dijkstra's algorithm is applied to calculate the shortest path. The resulting path is used to construct a visibility graph, and the Dijkstra's algorithm is reapplied to the resulting graph. The proposed approach allows to build a route that is optimal in terms of length and distance to obstacles. It significantly reduces the computational complexity of constructing a visibility graph. The approach was implemented in the freely distributed QGIS geographic information system for planning the route of a mobile robot in an aquatic environment. The results of the experiment showed that the Voronoi diagram reduced the number of vertices required to construct the visibility graph by 8.3 times, while the visibility graph improved the path obtained from the Voronoi diagram by 8%. The proposed approach can be used for global planning of routes for mobile robots in various environments.

ОСОБО ОХРАНЯЕМЫЕ ПРИРОДНЫЕ ТЕРРИТОРИИ В КОНТЕКСТЕ ГОРОДСКОГО ПЛАНИРОВАНИЯ ГОРОДА ПЕРМИ: ФУНКЦИИ И ПРОБЛЕМЫ

This article is a study using GIS technologies aimed at assessing and analyzing changes in the areas of types of plant communities under the influence of oil and gas industry facilities on the island. Sakhalin.
 Purpose (Object): The purpose of this study is to assess the degree of change in the areas of types of plant communities under the influence of oil and gas indus-try facilities on the island. Sakhalin.
 Methods: Methodology for assessing changes in the areas of plant communi-ties under the influence of oil and gas industry facilities on the island. Sakhalin in-cludes 7 stages, consisting of spatial reference of a raster image (vegetation map of the island) to a base map, as well as the subsequent creation of polygonal objects based on the received data and conducting spatial analysis in ArcGIS software. The final stage involves determining the degree of change using specified criteria.
 Findings: Most of the types of plant communities on Sakhalin Island belong to the conditionally unmodified class with the percentage of the territory occupied by oil and gas industry facilities less than 0.5%. We assigned the following types of plant communities to this class: white birch-larch grass-shrub forests in place of dark coniferous forests (0.00%); reed grass communities in place of green moss and grassy dark coniferous forests (0.17%); etc. The weakly modified class in-cludes 4 types of communities: larch mid-taiga lichen forests with dwarf cedar (0.75%); thickets of wild rosemary in place of larch green moss-ledum forests (0.74%); larch mid-taiga green moss-ledum forests (0.69%); thickets of dwarf ce-dar and alder (0.59%). None of the existing types of plant communities on Sakhalin Island belongs to the moderately or highly modified class, since the area of land occupied by oil and gas industry facilities does not exceed 2%.
 Conclusions: Assessment of the degree of change in areas occupied by various types of plant communities under the influence of oil and gas industry facilities on the island. Sakhalin makes it possible to determine the most disturbed types of communities and classify them according to the degree of change.
 This information is useful in view of the relevance of the issue of environmental pollution by oil and gas industry facilities, as well as from the point of view of the possibility of developing measures to protect and protect the environment. In addi-tion, based on the data obtained, it is possible to predict further changes in the de-velopment of Sakhalin shelf projects and the construction of new onshore infra-structure.

Packing Soft Polygons in a Minimum Height Rectangular Target Domain

The paper studies packing polygons of variable shapes, regarding the stretching coefficient, in a rectangular target domain of minimum height. Packing objects of a variable shape have a wide spectrum of applications, e.g, in biology, materials science, mechanics, land allocation, and logistics. Interest in these problems is also due to the modeling of the structures of porous media under pressure, e.g., for creating test models of artificial digital cores. Elements of porous media can be deformed under the influence of an external force, but the mass of each particle remains unchanged. This corresponds to conservation of area for the two-dimensional case. Polygonal objects must be completely contained within the target domain (containment constraint) and do not overlap (non-overlapping constraint), provided they have free translations, continuous rotations, stretch transformations, and conserve their area. The phi-function technique is used for an analytical description of the placement constraints for variable shape polygons. Quasi-phi-functions for describing non-overlapping constraints and phi-functions for describing containment constraints are defined. The packing problem is presented in the form of a nonlinear programming model. A solution strategy is proposed, which consists of the following stages: generation of feasible starting points; search for local minima of the problem of packing soft polygons for each starting point using the decomposition algorithm; choosing the best local minimum found at the previous stage. To search for smart starting arrangements, an optimization algorithm for packing original polygons using their homothetic transformations is applied. Decomposition of the problem of packing polygons of variable shapes is based on an iterative procedure that allows reducing a large-scale problem to a sequence of smaller nonlinear programming problems (linear to the number of objects). Numerical examples are provided for oriented rectangles and non-oriented regular polygons. Keywords: packing, polygons, stretch transformation, rectangular container, quasi-phi-functions, optimization, decomposition algorithm.

Cooperative object transportation with differential-drive mobile robots: Control and experimentation

Non-prehensile cooperative object transportation is a challenging model problem for distributed control and organization methods but also has practical applications. Therefore, it is widely studied in distributed robotics research. This paper describes and evaluates a novel transportation scheme for differential-drive mobile robots that is, to the authors’ best knowledge, the most versatile scheme of its kind successfully evaluated with real-world hardware. The proposed scheme can conceptually deal with any number of robots and arbitrary polygonal objects, including non-convex ones, without having to retune, retrain, or reconfigure any of the control parameters between different scenarios. This is achieved by splitting the task into a formation control and a formation finding task, both of which are tackled with model-based approaches using distributed optimization. Formation control and formation finding are complicated by the robots’ non-holonomic kinematic constraints. Therefore, a tailored distributed model predictive controller is used for formation control. Finding formations relies on a multibody-dynamics representation of the robots-object system to properly account for contact and non-holonomic constraints. Due to these measures, the transportation scheme achieves a very satisfactory performance and dexterity in real-world hardware experiments utilizing network communication and distributed computation.

Research on Polygon Pest-Infected Leaf Region Detection Based on YOLOv8

Object detection in deep learning provides a viable solution for detecting crop-pest-infected regions. However, existing rectangle-based object detection methods are insufficient to accurately detect the shape of pest-infected regions. In addition, the method based on instance segmentation has a weak ability to detect the pest-infected regions at the edge of the leaves, resulting in unsatisfactory detection results. To solve these problems, we constructed a new polygon annotation dataset called PolyCorn, designed specifically for detecting corn leaf pest-infected regions. This was made to address the scarcity of polygon object detection datasets. Building upon this, we proposed a novel object detection model named Poly-YOLOv8, which can accurately and efficiently detect corn leaf pest-infected regions. Furthermore, we designed a loss calculation algorithm that is insensitive to ordering, thereby enhancing the robustness of the model. Simultaneously, we introduced a loss scaling factor based on the perimeter of the polygon, improving the detection ability for small objects. We constructed comparative experiments, and the results demonstrate that Poly-YOLOv8 outperformed other models in detecting irregularly shaped pest-infected regions, achieving 67.26% in mean average precision under 0.5 threshold (mAP50) and 128.5 in frames per second (FPS).

Detection of the separated endodontic instrument on periapical radiographs using a deep learning-based convolutional neural network algorithm.

The study evaluated the diagnostic performance of an artificial intelligence system to detect separated endodontic instruments on periapical radiograph radiographs. Three hundred seven periapical radiographs were collected and divided into 222 for training and 85 for testing to be fed to the Mask R-CNN model. Periapical radiographs were assigned to the training and test set and labelled on the DentiAssist labeling platform. Labelled polygonal objects had their bounding boxes automatically generated by the DentiAssist system. Fractured instruments were classified and segmented. As a result of the proposed method, the mean average precision (mAP) metric was 98.809%, the precision value was 95.238, while the recall reached 98.765 and the f1 score 96.969%. The threshold value of 80% was chosen for the bounding boxes working with the Intersection over Union (IoU) technique. The Mask R-CNN distinguished separated endodontic instruments on periapical radiographs.

A Versatile Approach to Polygonal Object Avoidance in Indoor Environments with Hardware Schemes Using an FPGA-Based Multi-Robot

Service robots perform versatile functions in indoor environments. This study focuses on obstacle avoidance using flock-type indoor-based multi-robots. Each robot was developed with rendezvous behavior and distributed intelligence to perform obstacle avoidance. The hardware scheme-based obstacle-avoidance algorithm was developed using a bio-inspired flock approach, which was developed with three stages. Initially, the algorithm estimates polygonal obstacles and their orientations. The second stage involves performing avoidance at different orientations of obstacles using a heuristic based Bug2 algorithm. The final stage involves performing a flock rendezvous with distributed approaches and linear movements using a behavioral control mechanism. VLSI architectures were developed for multi-robot obstacle avoidance algorithms and were coded using Verilog HDL. The novel design of this article integrates the multi-robot’s obstacle approaches with behavioral control and hardware scheme-based partial reconfiguration (PR) flow. The experiments were validated using FPGA-based multi-robots.

ALGORITHM FOR SUBSTANTIATING FACILITIES SELECTION FOR INTRODUCTION OF OIL PRODUCTION INNOVATIVE TECHNOLOGIES IN THE CONDITIONS OF THE LOWER CRETACEOUS DEPOSITS OF WESTERN SIBERIA

Link for citation: Mukhametshin V.V., Kuleshova L.S. Algorithm for substantiating facilities selection for introduction of oil production innovative technologies in the conditions of the lower cretaceous deposits of Western Siberia. Bulletin of the Tomsk Polytechnic University. Geo Аssets Engineering, 2023, vol. 334, no. 10, рр. 179-186. In Rus. The research relevance due to significant residual oil reserves, concentrated in Cretaceous deposits of the West Siberian oil and gas province, which require the creation of innovative oil production technologies. The important issue in this case is the selection of facilities for experimental industrial work. The main criterion for such selection is the maximum possible analog facilities availability, which will allow efficient technologies replication to improve the technical and economic indicators of facilities with a significant amount of hard-to-recover residual oil reserves. The aim of the research is to create an algorithm for selecting oil production facilities in the conditions of the Western Siberia fields for innovative technologies implementation. Methods: geological and commercial analysis, methods from the image recognition theory when processing geological and commercial material arrays for deposits that have been in development for a long time. Results. The authors proposed an algorithm for selecting development facilities for implementation of innovative technologies at the Lower Cretaceous facilities of the West Siberian oil and gas province. The algorithm was created based on the use of geological and physical parameters of formations affecting predominantly oil recovery. This algorithm creation is based on as well on the formulated criteria that the facility must satisfy (a significant number of facilities analogous to the landfill one in terms of the geological structure and formations and fluid properties affecting to the greatest extent the technical and economic indicators of the deposits development; presence of significant residual or not actively involved in the development oil reserves in analogue deposits; presence of facility identification algorithms, which allow establishing the facilities identity degree and assessing risks when applying new technologies in the conditions of analogue facilities). The selection of polygon objects is proposed to be carried out in three variants: within oil and gas-bearing areas, within stratigraphic systems, within tectonic elements, depending on the requirements of the subsurface user. The obtained algorithms make it possible to select objects for replication of positive practices, as well as to increase the success of the implementation of innovative technologies.

Vertical attention bias for tops of objects and bottoms of scenes.

Past research demonstrated a top-salience bias in object identification, with random shapes appearing more similar when they share the same top versus the same bottom. This is consistent with tops of natural objects and lifeforms tending to be more informative locations of intentionality and functionality, leading observers to favor attending to tops. However, this bias may also reflect a generic downward vantage tendency that occurs with more informative interactive aspects of scenes typically lying below the horizon. Two experiments test for this overall pattern of vertical attention bias (VAB) for both objects and scenes. Participants observed picture triptychs and judged if the center object or scene appeared more similar to flanking comparison figures that contain the same top versus same bottom. Experiment 1 used vertically information-balanced impoverished stimuli, either polygon objects or polygon-array scenes. Experiment 2 extended the triptych stimuli to naturalistic objects or scenes. Results generally support a VAB for object tops and scene bottoms that varies as a function of the informative aspects of visually attended stimuli. This pattern held for information-balanced objects but not scenes, however, with more ecologically valid naturalistic stimuli, VAB was large and robust, consistent with a vertical information imbalance that drives a generic downward vantage. (PsycInfo Database Record (c) 2023 APA, all rights reserved).

Raster Intervals: An Approximation Technique for Polygon Intersection Joins

Many data science applications, most notably Geographic Information Systems, require the computation of spatial joins between large object collections. The objective is to find pairs of objects that intersect, i.e., share at least one common point. The intersection test is very expensive especially for polygonal objects. Therefore, the objects are typically approximated by their minimum bounding rectangles (MBRs) and the join is performed in two steps. In the filter step, all pairs of objects whose MBRs intersect are identified as candidates; in the refinement step, each of the candidate pairs is verified for intersection. The refinement step has been shown notoriously expensive, especially for polygon-polygon joins, constituting the bottleneck of the entire process. We propose a novel approximation technique for polygons, which (i) rasterizes them using a fine grid, (ii) models groups of nearby cells that intersect a polygon as an interval, and (iii) encodes each interval by a bitstring that captures the overlap of each cell in it with the polygon. We also propose an efficient intermediate filter, which is applied on the object approximations before the refinement step, to avoid it for numerous object pairs. Via experimentation with real data, we show that the end-to-end spatial join cost can be reduced by up to one order of magnitude with the help of our filter and by at least three times compared to using alternative intermediate filters.

Construction and Analysis of Space–Time Paths for Moving Polygon Objects Based on Time Geography: A Case Study of Crime Events in the City of London

Time geography considers that the motion of moving objects can be expressed using space–time paths. The existing time geography methods construct space-time paths using discrete trajectory points of a moving point object to characterize its motion patterns. However, these methods are not suitable for moving polygon objects distributed by point sets. In this study, we took a type of crime event as the moving object and extracted its representative point at each moment, using the median center to downscale the polygon objects distributed by the point sets into point objects with timestamps. On this basis, space–time paths were generated by connecting the representative points at adjacent moments to extend the application scope of space–time paths, representing the motion feature from point objects to polygon objects. For the case of the City of London, we constructed a space–time path containing 13 nodes for each crime type (n = 14). Then, each edge of the space–time paths was considered as a monthly vector, which was analyzed statistically from two dimensions of direction and norm, respectively. The results showed that crime events mainly shifted to the east and west, and crime displacement was the greatest in April. Therefore, space–time paths as proposed in this study can characterize spatiotemporal trends of polygon objects (e.g., crime events) distributed by point sets, and police can achieve improved success by implementing targeted crime prevention measures according to the spatiotemporal characteristics of different crime types.

Differentiable Curl-Noise

We present Differentiable Curl-Noise, a C1 procedural method to animate strictly incompressible fluid flows in two dimensions. While both the original Curl-Noise method of Bridson et al. [2007] and a recent modification by Chang et al. [2022] have been used to design incompressible flow fields, they often suffer from non-smoothness in their handling of obstacles, owing in part to properties of the underlying Euclidean distance function or closest point function. We therefore propose a differentiable scheme that modulates the background potential in a manner that respects arbitrary solid simple polygonal objects placed at any location, without introducing discontinuities. We demonstrate that our new method yields improved flow fields in a set of two dimensional examples, including when obstacles are in close proximity or possess concavities.

A building polygonal object matching method based on minimum bounding rectangle combinatorial optimization and relaxation labeling

AbstractVolunteered geographic information (VGI) is an emerging phenomenon where anyone can create geographic information and share it with others. Compared with traditional authoritative geospatial data, it has several advantages, such as enriched data, instant updates, and low cost. The object matching method is widely used in VGI quality assessment and data updates. However, VGI matching faces certain challenges, such as the levels of detail that vary from object to object, the uneven distribution of data quality, and the automated matching requirement. To resolve these problems, this article proposes a new matching method that effectively combines the advantages of minimum bounding rectangle combinatorial optimization (MBRCO) and relaxation labeling. The proposed method (1) avoids setting the similarity threshold and weights and does not require training samples. This process is realized based on contextual information and optimization. (2) It overcomes the disadvantage that the MBRCO algorithm cannot distinguish adjacent buildings with similar shapes. Our approach is experimentally validated using two publicly available spatial datasets: OpenStreetMap and AutoNavi map. The experimental studies show that the proposed automatic matching method outperforms all the threshold‐based MBRCO methods and achieves high accuracy with a precision of 97.8% and a recall of 99.2%.

The Concept of a Georeferential Spatial Database of Topographic–Historical Objects (GSDoT-HO): A Case Study of the Cadastral Map of Toruń (Poland)

In this study, we aimed to further the international discussion on the methodology of applying GIS technology to the editing of large-scale cadastral maps, taking the experience of editing the cadastral map of Toruń from 1910–1915 as an example. We present the concept of building a georeferential spatial database of topographic–historical objects (GSDoT-HO), which includes the stages involved in creating the database, its exemplary structure, and a proposal of good practices in this process, which were developed in the course of previous projects using a geographic information system for Historical Atlases of Polish Towns. Our works included the scanning, calibration, and rectification of a total of 178 sheets of cadastral maps (including 154 sheets of the map of Toruń and 24 sheets of the cadastral map of the then-village of Mokre) at differentiated scales of 1:250, 1:500, 1:1000, and 1:2000. Finally, in the process of vectorization, vector and attribute data were acquired, which made up the final result in the form of GSDoT-HOs. This database was created out of seven information layers with linear or polygon geometries, including the two most important layers, i.e., plots and buildings, which for the then-area of the city of Toruń, contained approximately 5800 and 10,800 vectorised polygon objects, respectively. This article shifts the focus of the discussion of standards in the use of GIS technology to edit Historic Towns Atlases from the development of interactive maps to the construction of a database that should enable comparative studies of urban spaces.

Разработка программного модуля построения карт распределения вероятностей встречи с морским льдом для изучения дальневосточных морей

The article presents a description of the developed software module for creating maps of the probability distribution of encountering sea ice. The module allows to process collections of raster map files based on satellite data and obtain vector maps of the probability distribution of encountering sea ice. Source data is Japan Meteorological Agency (JMA) maps provided in raster format without georeferencing, and National Snow and Ice Data Center (NSIDC) maps provided in GeoTIFF format with georeferencing. The module implements an algorithm that allows to calculate the probability of ice occurrence of a given concentration interval at each point (pixel) of a raster map, and then build polygonal vector maps in SHP-format based on the array of probabilities. The algorithm for constructing polygonal objects provides for a sequential enumeration of all horizontal adjacent pairs of elements of the array of probabilities, followed by determining the boundaries of the polygon. Detection of the first points of the polygon boundary allows to start a cyclic search for adjacent points that meet the boundary condition and creating a complete list of points of a closed polygon. Similarly, all other polygons are searched within the water area specified by the color mask. At the last stage, the lists of Cartesian coordinates of points are converted into geographical coordinates. Based on them, polygonal objects are formed in the SHP-file format. Polygon features define areas of probability of encountering ice that belong to the same interval, and include numeric attributes with values for the boundaries of the probability intervals. The generated vector maps allow further data analysis in GIS applications. The developed software was used to build maps of the probability distribution of encountering ice in the waters of the Far Eastern seas.

Геоинформационная система «Речные бассейны России»

An electronic map of basin geosystems of small rivers has been created for almost the entire mainland of Russia. The form of representation is a vector layer of polygonal objects; spatial detail corresponds to the regional level of generalization (scale 1:1 000 000). The research was performed in three stages: 1) The European Part of Russia (with the exception of the Crimea and the Kaliningrad region); 2) The Arctic watershed area of the Asian Part of Russia; 3) The Pacific watershed area (Far Eastern Federal District). In total, over 388 000 objects (basins) have been allocated with an average area of about 47.8 km2. The method used for constructing the basin map includes: selection of the base DEM and the hydro grid map; selection of geometric parameters of the raster grid to represent the initial data and the results of model calculations; correction of the DEM using the hydro grid map; construction of watershed basin boundaries in automatic mode; assessment of the accuracy of the allocation of river basin boundaries for different types of terrain. A specialized geoinformation system “Basins of small rivers of Russia” has been formed. GIS integrates geoinformation representing natural (geomorphometry of the relief, the hydro-climatic parameters, sediment yield and river flow, soils, landscapes) and anthropogenic (land use types, population, transport network, etc.) characteristics of river basins. As an example of solving geoecological and geographical problems, calculations of the intensity of soil erosion for the Lena River basin using a modified model of soil loss are presented. The average value of soil erosion losses in the Lena River basin, taking into account the types of land cover, is 0.22 t/ha/year. This generally indicates a very low intensity of erosion, most of the basin area belongs to the nonhazardous category of soil loss.

Implementation of novel polygon‐based obfuscation methods to improve privacy of agricultural data

AbstractGeoprivacy protection is a significant concern when sharing data. To support sustainable land management by leveraging existing agricultural data, research is needed to identify how the polygon nature of static field parcels can be obfuscated to allow data sharing among individuals and organizations. In this study, five adaptive polygon‐based obfuscation methods including PN*Rand, PDonut‐k, PDensity‐k, PAHilb, and PDonut_AHilb methods were developed and applied on the Irish Nutrient Management Planning Online (NMP Online) agricultural dataset. The polygon‐based obfuscation methods introduced in this study were designed with the consideration of properties of spatial polygon objects including the spatial coordinates, shape and size of the polygon, topology, and spatial relationship between adjacent polygons that can be used to identify real‐world objects. These methods were developed to guarantee that there is no false‐identification and non‐unique obfuscation which is important for static polygon objects in terms of accuracy and privacy protection. Qualitative approaches were developed to identify the optimal values of inner and outer radii of donut shape based on k‐anonymity satisfaction and subsequently obtain the optimal value of k‐anonymity. Several evaluation methods were implemented to compare the methods performance. Density‐based methods particularly PDonut‐AHilb provide the best trade‐off between field parcel confidentiality and spatial pattern preservation and should be considered for researchers and practitioners obfuscating polygon data.

Construction of the differential surface admittance operator with an extended Fokas method for electromagnetic scattering at polygonal objects with arbitrary material parameters

This article presents a novel method to accurately simulate electromagnetic scattering at homogeneous polygonal cylinders with arbitrary material properties. A single source equivalence approach is invoked, allowing to substitute the background medium for the inner material of the scatterer, provided an equivalent surface current density is introduced. We construct the pertinent differential surface admittance operator by means of the Fokas method, establishing a map between the known Dirichlet boundary values and their unknown Neumann counterparts. However, to allow for lossy materials, we extend the Fokas method to complex wavenumbers. The novel formalism, employing pulse-shaped local basis functions, natively supports combined magnetic and dielectric contrast, accurately captures the skin effect, and is conveniently integrated in traditional boundary integral equation formulations. The correctness and versatility of our technique are verified for various examples by means of analytical validation and through comparison with a Poggio-Miller-Chan-Harrington-Wu-Tsai approach, a volume integral equation method and a commercial solver.

To the question of creating an open ecological geographic information system

Access to information about the state of the environment is an inalienable right of Ukrainian citizens, so the development and improvement of ways to provide information to the population with environmental data is of high social importance. A valuable source of reliable environmental data that can be used to inform the public are the results of scientific research on the state of the environment, which are produced by the activities of higher education institutions. This article considers the possibilities of using web-GIS services by higher education institutions as a means of communicating environmental information to the general public. Purpose. To create an open geographic information system that should represent the database of environmental geodata obtained in the process of educational and scientific work of students and staff of the Karazin Institute of Environmental Sciences. Methods. Analysis of the stock materials of the Institute of Ecology for the needs of forming a geodatabase, development of the structure of the attributive web-GIS database and testing the functionality of the ArcGIS Online cloud mapping platform service for exporting, updating, storing, searching and visualizing data presentation in web-GIS. Results. A methodical algorithm for the development and creation of web-GIS is proposed and tested, consisting of the following stages: 1) selection of the technological base of development; 2) analysis of materials providing input information; 3) development of the structure of the attributive database of the project; 4) preparation of geodata sets and their publication on the Internet. As a result of the analysis 144 scientific papers were selected, which will form the information basis for the formation of the web-GIS "EcoSpace". The structure of the attributive database of the web-GIS project was developed, consisting of 4 content blocks and 11 types of descriptive data. 3 sets of test data were prepared, which showed successful results of export and visualization of geodata represented by different types of geometric vector primitives (linear, point and polygonal objects). Conclusions. A prototype of the web-GIS "EcoSpace" (https://institute-of-environmental-sciences-data-portal-carto-lab.hub.arcgis.com/) was developed in the environment of the ArcGIS Online Internet service, which can be used to publish information about the state of the environment contained in the results of scientific research of students and staff of the Karazin Institute of Environmental Sciences. The information content of the web-GIS "EcoSpace" has been started, in particular, the results of three scientific projects concerning the state of soil resources of Kharkiv district of Kharkiv region have been entered.