In this paper, we describe exact methods to solve two problems: given a set S of n points in
the plane, find a simple polygon whose set of vertices is precisely S and has minimum (Min …

We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-
Area) possible area for a given set of points in the plane. Both problems are known to be NP …

We provide exact and approximation methods for solving a geometric relaxation of the
Traveling Salesman Problem (TSP) that occurs in curve reconstruction: for a given set of …

Route planning and airspace sectorisation are two central tasks in air traffic management.
Traditionally, the routing and sectorisation problems were considered separately, with …

• International Air Transport Association (IATA) projected that the number of passengers will
double to reach 7 billion/year by 2034• Terminal Maneuvering Area (TMA) is particularly …

In this paper an airspace sectorization framework for terminal maneuvering areas based on
mixed integer programming is presented. It incorporates an airspace complexity …

We study a variety of sparsification approaches for a spectrum of geometric optimization
problems related to tour problems, such as the Angular TSP, the Minimum Perimeter …

● Review of sectorization method that balances sector task load● Extension by convex
sectors● Results for Stockholm TMA● Comparison to convex sectorizations obtained by …

In this paper, we propose modifications of some known efficient algorithms for solving the
problem of MAP (finding a simple polygon of minimum area). We propose an algorithm that …

A polygon is simple if it is a closed chain of straight line segments that do not self-intersect.
Given a finite set P of input points in the Euclidean plane, the search for a simple polygon …