Airspace Sectorization and Comparison via Computational Geometry, OpenCV and Networkx

This paper proposes new approaches for partitioning the airspace dynamically Due to the exponential increase of the traffic flow, which will generate a huge amount of workload that would be difficult for controllers to handle. This is why our focus is to optimize the management system by presenting a dynamic and flexible approach meeting the demand. The problem of partitioning is an NP-hard set of problems, which makes it complex in formulating, and no exhaustive solutions are possible. The first phase is the partition phase, which will focus on the geometry of the space, which is why we will use the Voronoi diagram and compare it to the actual sectors. The second phase is about generating the network of routes in the airspace completing our diagram.