DeepAI AI Chat
Log In Sign Up

Polygon Area Decomposition Using a Compactness Metric

by   Mariusz Wzorek, et al.

In this paper, we consider the problem of partitioning a polygon into a set of connected disjoint sub-polygons, each of which covers an area of a specific size. The work is motivated by terrain covering applications in robotics, where the goal is to find a set of efficient plans for a team of heterogeneous robots to cover a given area. Within this application, solving a polygon partitioning problem is an essential stepping stone. Unlike previous work, the problem formulation proposed in this paper also considers a compactness metric of the generated sub-polygons, in addition to the area size constraints. Maximizing the compactness of sub-polygons directly influences the optimality of any generated motion plans. Consequently, this increases the efficiency with which robotic tasks can be performed within each sub-region. The proposed problem representation is based on grid cell decomposition and a potential field model that allows for the use of standard optimization techniques. A new algorithm, the AreaDecompose algorithm, is proposed to solve this problem. The algorithm includes a number of existing and new optimization techniques combined with two post-processing methods. The approach has been evaluated on a set of randomly generated polygons which are then divided using different criteria and the results have been compared with a state-of-the-art algorithm. Results show that the proposed algorithm can efficiently divide polygon regions maximizing compactness of the resulting partitions, where the sub-polygon regions are on average up to 73


page 1

page 7

page 8

page 13


A Divide and Conquer Approximation Algorithm for Partitioning Rectangles

Given a rectangle R with area A and a set of areas L={A_1,...,A_n} with ...

Efficient covering of convex domains by congruent discs

In this paper, we consider the problem of covering a plane region with u...

The Solidarity Cover Problem

Various real-world problems consist of partitioning a set of locations i...

Space Partitioning Schemes and Algorithms for Generating Regular and Spiral Treemaps

Treemaps have been widely applied to the visualization of hierarchical d...

Balanced Line Coverage in Large-scale Urban Scene

Line coverage is to cover linear infrastructure modeled as 1D segments b...

Persistent Covering of a Graph under Latency and Energy Constraints

Most consumer-level low-cost unmanned aerial vehicles (UAVs) have limite...