Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
An Behavior-based Robotics
Robot Teams: From Diversity to Polymorphism
Robot Teams: From Diversity to Polymorphism
Coverage for robotics – A survey of recent results
Annals of Mathematics and Artificial Intelligence
Radial Perfect Partitions of Convex Sets in the Plane
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Equipartitions of Measures by 2-Fans
Discrete & Computational Geometry
Minimum-cost load-balancing partitions
Proceedings of the twenty-second annual symposium on Computational geometry
Distributed coordination algorithms for mobile robot swarms: new directions and challenges
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
| Hi-index | 0.00 |
This paper presents an algorithm for convex polygon decomposition around a given set of locations. Given an n-vertex convex polygon Pand a set Xof kpoints positioned arbitrarily inside P, the task is to divide Pinto kequal area convex parts, each containing exactly one point of X. The problem is motivated by a terrain covering task for a swarm of autonomous mobile robots. The algorithm runs in time O(kn+ k2logk).