Implementation of algorithm for generalization of cartographic objects

Here is an implementation of map generalization algorithm (The idea is described here). There are following directories and files:

• graphical_app.py - simple demonstrative app. In it you can generate random polyline and watch results of 5 main steps:

  • Bringing a polyline to an equidistant form
  • Polyline segmentation
  • Douglas-Peucker simplification
  • Smoothing with B-splines

  Also you can read polyline from file to work with your own data. Please, generate polylines which has less than 120 vertexes, because default settings and generation algorithm guarantee correctness only with such number of vertexes

• console_app.py - the same app, but without graphics

• logic - the algorithm itself. All computations and geometry

• settings - settings of developed applications

• data - some additional data such as results of tests and dots of real cartographic objects

• presentation - presentation for joint scientific seminar INM RAS - Huawei

Example of program's work

Future work

• Implementing real-time scaling in graphical app (with simplification and without)
• Implementing canvas movement for correct drawing of large polylines
• Implementing new algorithms of random polylines generation
• Implementing graphical interface for settings
• Implementing simplified polyline saving
• Answering questions, which are mentioned in the presentation
• Further research