arXiv:2611.07701 · v1

K-subareas partitioning subject to coinciding boundary segments of neighboring subareas

首次提交 2026-11-05 17:23

版本更新 2026-11-05 17:23

雷达观测 2026-11-06 11:06

摘要

A method for the problem of partitioning an area into K subareas subject to coinciding boundary segments of neighboring subareas is presented. The given area may be non-convex and may additionally include obstacle areas. The proposed hierarchical method involves three steps: repeated bisection splitting, merging and the solution of traveling salesman problems. Geographic real-world outdoors areas data is used for the evaluation of the method. The benefit of computational simplicity at the cost of imbalanced subarea sizes is highlighted.

作者备注：6 pages, 10 figures