The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A significant visualization problem in automated cartography and Geographical Information Systems (GIS) is the map-labeling problem, which consists of placing text labels adjacent to geographic features in order to convey their meaning. In this paper, we propose one practical method for labeling line features using discrete model. A text label is treated as a sequence of axis-parallel squares considering...
It is a critical technique in GIS about how to implement map overlay with high performance. To avoid the disadvantages of computational geometry algorithm approach, an optimal algorithm based on rasterization is proposed in this paper, which adopts approach of rasterization of vector polygons with run length encoded scan line, map overlay on the basis of raster representation and vectorization of...
Creating 3D city from the geographical information is an important goal in the field of visualization for GIS and the needs for Web GIS are growing and expanding rapidly. Many scenes of the 3D cities are built based on the models which are made by computer aided designing software to present real scenes, however, this method costs too much time and labor with the low efficiency. This paper presents...
Optimal path planning is the critical technology for public transit system. In this paper, we propose a new transit path planning model- 3-layers heterogeneous road network model (3-LHRN). Based on this model, we can generate optimal path results, making a good match with real life. Some approaches have been explored in the past to tackle the optimal path planning issues. Taking aim at the least transfers,...
In this paper we introduced a new R-tree node splitting algorithm. As an indexing technique for multi-dimensional data, R-tree is widely used in geographical information systems, CAD systems and spatial databases. An R-tree consists of nodes which in turn consist of records. Each node in R-tree must contain limited number of records in order that it can be stored within one disk block, thus a node...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.