Loading Events
  • This event has passed.

COMPUTING ALGORITHM FOR GEOSPATIAL DATA SESSION 1

March 16, 2024 @ 9:30 am - 11:00 am

A map depicts a phenomenon at a smaller scale and thus it has a constraint of how to present the map elements graphically the scale. Map Generalisation, also known as Cartographic Generalisation is the selection and simplified representation of detail appropriate to the scale and/or the purpose of a map. This is a very essential tool in modern cartography and Geographical Information Systems (GIS). The objective of generalisation is to supply information on a content and detail level corresponding to the necessary information for correct geographical reasoning. The available space on a map for cartographic representations of all objects and elements of a landscape is very small and decreases disproportionately from scale to scale. This needs efficient algorithms to select and simplify map elements so that the essential map elements and objects can be kept appropriate for the reduced an image area from scale to scale. The current workshop looks into a theoretical and practical approach to various map simplification algorithms.

 

Learning Objectives:

  • Generalisation necessity for cartography and GIS
  • Common rules for Map generalisation
  • Map Simplification Techniques
  • Analysis simplification algorithms like Douglas-Peucker, Visvalingam–Whyatt algorithm etc.
  • Practical Demonstration of Map Simplification using GIS Software

Venue

Block 1, Ground Floor, Room no. 013, CHRIST(Deemed to be University), Kengeri Campus

Kanmanike
Bangalore, 560074 India
Back to Top