An Automated Schematic Method Based on Dynamic Grid for Service Area Map

An Automated Schematic Method Based on Dynamic Grid for Service Area Map

Zuofei Tan Shenglin LiZhaoxia Wang Yudong Guo Xiaofu Wei

Department, Logistics Information & Logistic Engineering, Logistic Engineering University of China, Chongqing

Corresponding Author Email: 
492739390@qq.com
Page: 
140-160
|
DOI: 
https://doi.org/10.18280/ama_b.600109
Received: 
15 March 2017
| |
Accepted: 
15 April 2017
| | Citation

OPEN ACCESS

Abstract: 

This paper presents an automatic mechanism for service area maps. This method of mechanism includes a set of strategies to simplify the outlines of public facilities. A number of constraints are defined, which are used to keep the directions and topology layout of maps. Other constraints are used to keep the relative locations among facilities and lines in themselves. Those constraints construct a classic linear programming to solve the optimal value of the objective function consisting of dynamic grid radiuses. This paper shows the method through a street map, and verifies the method both in a qualitative evaluation and a quantitative evaluation. The experimental results indicate that the method realizes the map-schematic process and reduces topological confliction. Moreover, the method has better schematization and similarity for original map.

Keywords: 

Schematization; Service area map; Dynamic grid; Relative location maintaining; Linear programming; Fractal dimension

1. Introduction
2. Related Works
3. Schematic Method
4. Experiment Design
5. Conclusion
  References

[1] Z. Nougrara, Towards Robust Analysis of Satellite Images of Algeria Application to Road Network and its Nodes Extraction, 2015, AMSE Journals, vol. 28, no.1, pp.53-66.

[2] Ping Wan, Kaiwen Luo, Application of Device Control and Manage Method in Military, 2016, Review of Computer Engineering Studies, vol. 3, no. 2, pp.29-33.

[3] Klippel A, Richter K F, Barkowsky T, The Cognitive Reality of Schematic Maps, 2005, Map-based Mobile Services, Springer Berlin Heidelberg, pp.55-71.

[4] Tversky B, Lee P U, Pictorial and Verbal Tools for Conveying Routes, 1999, Spatial Information Theory: Cognitive and Computational Foundations of Geographic Information Science, International Conference COSIT '99, 1999, Stade, Germany, pp.51-64.

[5] Hadlaw J, The London Underground Map: Imagining Modern Time and Space, 2003, Design Issues, vol. 19, no. 1, pp.25-35.

[6] Neyer G, Line Simplification with Restricted Orientations, 1999, Lecture Notes in Computer Science, vol. 1663, pp.13-24.

[7] Merrick D, Gudmundsson J, Path Simplification for Metro Map Layout, 2006, International Conference on Graph Drawing, 2006, Berlin, Germany, pp.258-269.

[8] Cabello S, Kreveld M V, Schematic Networks: An Algorithm and its Implementation, 2002, Advances in Spatial Data Handling, Springer Berlin Heidelberg, pp.475-486.

[9] Cabello Justo S, De Berg M T, Van Kreveld M J, Schematization of Networks, 2005, Computational Geometry Theory & Applications, vol. 30, no. 3, pp.223-238.

[10] Barkowsky T, Latecki L J, Kai F R, Schematizing Maps: Simplification of Geographic Shape by Discrete Curve Evolution, 2000, Lecture Notes in Computer Science, vol.1849, pp.41-53.

[11] Oke O, Siddiqui S, Efficient automated schematic map drawing using multiobjective mixed integer programming, 2015, Computers & Operations Research, vol. 61, pp.1-17.

[12] Ware J M, Taylor G E, Anand S, Automated Production of Schematic Maps for Mobile Applications, 2006, Transactions in Gis, vol. 10, no. 1, pp.25-42.

[13] Anand S, Avelar S, Ware J M, Automated schematic map production using simulated annealing and gradient descent approaches, 2007, Proceedings of the 15th Annual GIS Research UK Conference, 2007, Dublin, Ireland, pp.11-13.

[14] Hong S H, Merrick D, Nascimento Hadd, Automatic visualisation of metro maps, 2006, Journal of Visual Languages & Computing, vol. 17, no. 3, pp.203-224.

[15] Stott J, Rodgers P, Martínezovando J C, Automatic Metro Map Layout Using Multicriteria Optimization, 2011, Visualization & Computer Graphics IEEE Transactions on, vol. 17, no. 1, pp.101-114.

[16] Nöllenburg M, Wolff A, Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming, 2010, Visualization & Computer Graphics IEEE Transactions on, vol. 17, no. 5, pp.626-641.

[17] Regnauld N, Contextual Building Typification in Automated Map Generalization, 2001, Algorithmica, vol. 30, no. 2, pp.312-333.

[18] J. H. Haunert and A. Wolff, Optimal and topologically safe simplification of building footprints, 2010, Sigspatial International Conference on Advances in Geographic Information Systems, 2010, ACM, pp.192-201.

[19] Li Zhenhua, Yang Chuncheng, Wei Fu, A displacement algorithm based on geometry similarity for spatial conflicts between roads and buildings, 2016, Acta Geodaetica et Cartographica Sinica, vol. 45, no. 6, pp.747-755.

[20] Ti P, Li Z, Generation of schematic network maps with automated detection and enlargement of congested areas, 2014, International Journal of Geographical Information Science vol. 28, no. 3, pp.521-540.

[21] Fu Zhongliang, Weng Baofeng, Hu Yulong, A schematic method based on the integration of stroke construction and displacement for road network, 2016, Acta Geodaetica et Cartographica Sinica, vol. 45, no. 9, pp.1115-1121.

[22] Sarkar N, Chaudhuri B B, An efficient differential box-counting approach to compute fractal dimension of image, 1994, IEEE Transactions on Systems Man & Cybernetics, vol. 24, no. 1, pp.115-120.