Abstract We present a new method for the task of detecting groups of polygons in a given geographic data set and computing a representative polygon for each group. This task is relevant in map generalization where the aim is to derive a less detailed map from a given map. Following a classical approach, we define the output polygons by merging the... We present a new method for the task of detecting groups of polygons in a given geographic data set and computing a representative polygon for each group. This task is relevant in map generalization where the aim is to derive a less detailed map from a given map. Following a classical approach, we define the output polygons by merging the input polygons with a set of triangles that we select from a constrained Delaunay triangulation of the input polygons’ exterior. The innovation of our method is to compute the selection of triangles by solving a bicriteria optimization problem. While on the one hand we aim at minimizing the total area of the outputs polygons, we aim on the other hand at minimizing their total perimeter. We combine these two objectives in a weighted sum and study two computational problems that naturally arise. In the first problem, the parameter that balances the two objectives is fixed and the aim is to compute a single optimal solution. In the second problem, the aim is to compute a set containing an optimal solution for every possible value of the parameter. We present efficient algorithms for these problems based on computing a minimum cut in an appropriately defined graph. Moreover, we show how the result set of the second problem can be approximated with few solutions. In an experimental evaluation, we finally show that the method is able to derive settlement areas from building footprints that are similar to reference solutions. Read More Read Less

Abstract Isolines share link different places that share a common value. Efforts have been done to reduce the complexity of drawing lines during the measurement of geometric similarities. The isolines that have common scalar filed, the geometric similarity of the isolines and the separation is not easy. We should keep the similarities and structure intact which help to described the terrains.... Isolines share link different places that share a common value. Efforts have been done to reduce the complexity of drawing lines during the measurement of geometric similarities. The isolines that have common scalar filed, the geometric similarity of the isolines and the separation is not easy. We should keep the similarities and structure intact which help to described the terrains. We have developed algorithm to address the complexity of isolines when studying the harmony. During the testing of the algorithms we found it more efficient. Read More Read Less

Abstract IoT is found to yield many applications out of which the one that help address the real-time and low latency requirements. This kind of needs develop new challenges while offering service to users. The requirements are currently filled by the present cloud computing applications. The new domain Fog computing can able to address the requirements for the hybrid environment service... IoT is found to yield many applications out of which the one that help address the real-time and low latency requirements. This kind of needs develop new challenges while offering service to users. The requirements are currently filled by the present cloud computing applications. The new domain Fog computing can able to address the requirements for the hybrid environment service orchestration. The network edge bring the cloud computing provides more geographic coverage, low latency and higher load balancing. The current developments support the orchestration within the large as well as complex environments and ensure reliable services. This work asses the Hybrid Environment Service Orchestrator (HESO) for resilient and trustworthy Fog Computing services in terms of network latency. This process is aimed to address the real-time big data analysis, 5G networks and IoT. Read More Read Less