Graph Theory in Map

Generalization: Enhancing
Spatial Representations
Background of the study
This paper examines the use of graph theory to aid in the subtle implementation of specific

techniques. During the map design process, generalization techniques are used. The concept of space is

encapsulated in the representation of space. The portrayal of the interconnectedness of salient elements, as

well as aesthetics;

Many of the cartographic hand's intricacies rely on a thorough understanding of those linkages. It is

suggested that any comparable automated system must explicitly have the same rich knowledge.

Alternatively, each feature can be implicitly stored. The implications for database architecture from this

point of view are not the same as those that require efficiency or cater to spatial queries.
Statement of the Problem
The application of graph theory to various problem domains, such as traveling

salespersons, circuit board design, and network analysis, has proven to be versatile and

effective. Despite its established success in diverse fields, its utilization in the realm of

Geography, particularly in the context of map generalization and connectivity, remains an

area warranting exploration.

Significant of the Study

This paper is significant because it dives into the use of graph theory in map

generalization and connectedness, with the goal of improving spatial representation in

mapping. The research aims to provide practical insights and strategies for improving

map generalization techniques by exploiting the adaptable principles of graph theory.

Scope and Limitation
This research explores the use of graph theory in map generalization with the goal of improving spatial

representations in cartography. However, it has limits, such as potential gaps in covering all graph

theory applications in cartography and practical constraints connected to specific datasets and

techniques.
Methodology
In this methodology, we first construct a graph G to represent
spatial relationships in the map, excluding directional graphs and loops.
The connectivity index is then calculated using the formula ½ ⋅ n ⋅
(n−1), providing a percentage of completeness to quantify network
connectivity.
Definition

For an excellent introduction into graph theory and all that it affords,
the reader is referred to Hartsfield and Ringel (1990) and Wilson (1979).
This paper touches on a small part of graph theory looking particularly at
finite weighted and directional graphs. It begins by describing some of the
terms used in graph theory and some of their more basic properties.
Remark
The section following looks at some rules for generalization derived from the application of
graph theory to map generalization. A graph is made of vertices (A, B, C, D, E in Figure 1), and
edges ( AB , AD , CD, BC , DE, CE, BD , AC ). The degree of a vertex is the number of edges that
have that vertex as an endpoint (for example vertex D is of degree 4, having edges BD, AD, CD,
and DE).
Remark
Figure 2 shows a weighted (non-directional) finite graph theoretic representation of an
urban area at 1: 50 000 (example is taken from Keates 1989, p46). The graph has a similar
orientation and shape to help the reader interpret which roads got what weight. The weights
given to both the edges and vertices (indicated in the key) enable the subsequent generalization
of the network at 1: 100 000 and 1: 250 000. Some vertices have been added at the periphery
merely to make the graph finite. The graph was derived by viewing the map at 1: 250 000 and
working up to 1:50 000.
Illustration

This figure shows isomorphism and degrees of vertices in 1a

Illustration
This Figure shows Graph theoretic
representation 'reverse engineered' from
an example by Keates (1989).
Illustration

This Table Degree of Completeness for the three maps in 2nd Figure above
Result

This paper has shown how graph theory can be applied to help with a
number of design problems; in the first instance, weighted graphs and/or
directional graphs can be used to hierarchically omit or delete classes of features.
The examples given in this paper included tributary removal based on Strahler's
stream ordering, and road classification enabled the simplification of urban road
networks.
Recommendation

It is strongly advised to integrate graph theory methodologies into map design processes,

particularly for urban areas, to ensure the preservation of road network connectivity. Prioritizing

connectivity over nuances in street complexity can lead to more accurate representations of spatial

relationships within towns and cities.

Source
Crovari, P. (2019, May 20). Google Maps and Graph theory. Impactscool Magazine.

https://magazine.impactscool.com/en/speciali/google-maps-e-la-teoria-dei-grafi/
Thank
You Bonado, Jhun

Datinguinoo, Jm

Mallari, Louisana

Pellicano, Jhonna

Valencia, Faith