Optimization of Grid-Graphs using Segmentation

This work examines the effects of reducing the number of nodes and edges in a grid-graph, which consists of heterogeneous node blocks. An optimization method that reduces the count of nodes and edges is presented. Approaches that make traversing the graph easier by using this method are explained with examples. Efficiency of the method is observed using different pathfinding algorithms.