• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.543-554
• /
• 2002

GIS (Geographic Information Systems) need faster access and better visualization. For faster access and better visualization in GIS, map generalization and levels of detail are needed. Existing spatial indexing methods do not support map generalization. Also, a few existing spatial indexing methods supporting map generalization do not support ail map generalization operations. We propose a new index structure, i.e. the LR-tree, supporting ail map generalization operations. This paper presents algorithms for the searching and updating the LR-tree and the results of performance evaluation. Our index structure works better than other spatial indexing methods for map generalization.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.187-191
• /
• 2008

In the mobile environments for the vector map services, a map simplification work through the map generalization steps helps improve the readability of the map on a large scale. The generalization operations are various such as selection, aggregation, simplification, displacement, and so on, the formal operation algorithms have not been built yet. Because the algorithms require deep special knowledge and heuristic, which make it hard to automate the processes. This thesis proposes some map generalization algorithms specialized in mobile vector map services, based on previous works. This thesis will show the detail to adapt the approaches on the mobile environment, to display complex spatial objects efficiently on the mobile devices which have restriction on the resources.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.367-376
• /
• 2001

For the electronic map service by wireless, the existing map database cannot be used directly. This is because, the data volume of a map is too big to transfer by wireless and although the map is transferred successfully, the devices to display the map usually don’t have enough resources as the ones for desktop computers. It is also not acceptable to construct map database for the exclusive use of wireless service because of the vast cost. We propose new technique to generate a map for wireless service dynamically, from the existing map database. This technique includes the generalization method to reduce the map data volume and filtering method to guarantee that the data volume don’t exceed the limit of bandwidth. The generalization is performed in 3 steps :ㅁ step of merging the layers, a step of reducing the size of spatial objects, and a step of processing user interface. The filtering is performed by 2 module, counter and selector module. The counter module checks whether the data blume of generated map by generalization, exceeds the bandwidth limit. The selector module eliminates the excess objects and selects the rest, on the basis of distance.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.27 no.1
• /
• pp.735-742
• /
• 2009

National Geographic Institute recently has produced a national paper map by means of a computer aided editing system using a national digital map 2.0. However, the map generalization should be made due to the portrayal difference between the digital map and the paper one and the criterion of the map generalization should be determined by the visual image. The tolerance limit of the map generalization has to be decided based on human vision. For this purpose, this study attempts to measure the size of the building on various scale map and then analyze its result. As a consequence, this study shows us that the building size eligible for human vision should be over 0.4mm in the short side of building on the map. The tolerance limit of an isolated building, a reduced building and a densely built-up area for the map generalization is based on the criterion mentioned above.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.167-170
• /
• 2005

In the mobile environments for the vector map services, a map simplification work through the map generalization steps helps improve the readability of the map on a large scale. The generalization operations are various such as selection, aggregation, simplification, displacement, and so on, the formal operation algorithms have not been built yet. Because the algorithms require deep special knowledge and heuristic, which make it hard to automate the processes. This thesis proposes some map generalization algorithms specialized in mobile vector map services, based on previous works. We will show the detail to adapt the approaches on the mobile environment, to display complex spatial objects efficiently on the mobile devices which have restriction on the resources

• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.15-22
• /
• 2004

Map services for cellular phone have problem for implementation, which are the limitation of a screen size. To effectively represent map data on screen of celluar phone, it need a process which translate a detailed map data into less detailed data using map generalization, and it should manipulate zoom in out quickly by leveling the generalized data. However, current spatial indexing methods supporting map generalization do not support all map generalization operations. In this paper, We propose a leveled spatial indexing method, LMG-tree, supporting map generalization and presents the results of performance evaluation.

• Journal of Korean Society for Geospatial Information Science
• /
• v.8 no.2 s.16
• /
• pp.35-46
• /
• 2000

The digital maps, important data to build NGIS, require different scales in the same area. The organization for producing a digital map tries to find product method for digital map with economical efficiency and quality. The objectives of this study is to develope digital map generalization system to solve above problems. In order to develop this system, the work processing for digital map generalization is established, the analysis of related law and analysis on maps in different scales were performed, and each of digital map generalization algorithms was compared. The result of digital map generalization using this system shows that have a good result about positional accuracy which was evaluated by comparison between the generalized 1/25,000 and the corresponding 1/5,000 digital map. Furthermore, this system reduce the time required for 1/25,000 digital map production and the physical data amount by around 80%. In conclusion, the generalization system developed for this research can be useful for the digital map generalization from large scale to small scale digital map.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.19-21
• /
• 2010

In this study, regarding to the generalization of the map, we analyze how the different tolerances influence on the performances of linear generalization operators. For the analysis, we apply the generalization operators, especially two simplification algorithms provided in the commercial GIS software, to 1:1000 digital topographic map for analyzing the aspect of the changes in positional error depending on the tolerances. And we evaluate the changes in positional error with the quantitative assessments. The results show that the analysis can be used as the criteria for determining proper tolerance in linear generalization.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.5
• /
• pp.435-444
• /
• 2012

Although the multi-scale map database should be constructed for the web map services and location-based services, much part of generation process is based on the manual editing. In this study, the map generalization methodology for automatic construction of multi-scale database from the primary data is proposed. Moreover, the generalization methodology is applied to the real map data and the prototype of multi-scale map dataset is generated. Among the generalization operators, selection/elimination, simplification and amalgamation/aggregation is applied in organized manner. The algorithm and parameters for generalization is determined experimentally considering T$\ddot{o}$pfer's radical law, minimum drawable object of map and visual aspect. The target scale level is five(1:1,000, 1:5,000, 1:25,000, 1:100,000, 1:500,000) and for the target data, new address data and digital topographic map is used.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.1
• /
• pp.21-28
• /
• 2011

In the existing digital map of the Ver.1.0, it is impossible to make a small scale digital map, which is under the 1/5000 scale map, by using the 1/1000 digital map which is the most large scale one. Because of this reason, the existing digital maps are produced into a 1/1000 and a 1/5000 map by means of two different scale aerial photos. The next generation digital map should be successively related to a small scale digital map based on the most large scale digital one. This is so important from the aspects of data share and the consecutive renewal. Ever since the development of the digital map of the Ver. 2.0, the possibility of making a multi-scale consecutive digital map has been presented and the related research has been done again. The most basic thing in the multi-scale digital maps is to decide the criteria of the generalization between the two scales. In this study, I try to formulate the criteria of the generalization required to make the 1/5000 digital map by using the 111000 digital one. In addition, I by to explore the application possibility of the consecutive renewal by carrying out auto-generalization.