Approximating robot configuration spaces with few convex sets using clique covers of visibility graphs
Many computations in robotics can be dramatically accelerated if the robot configuration
space is described as a collection of simple sets. For example, recently developed motion …
space is described as a collection of simple sets. For example, recently developed motion …
Maximum polygon packing: The cg: shop challenge 2024
We give an overview of the 2024 Computational Geometry Challenge targeting the
problem\textsc {Maximum Polygon Packing}: Given a convex region $ P $ in the plane, and …
problem\textsc {Maximum Polygon Packing}: Given a convex region $ P $ in the plane, and …
Shadoks approach to convex covering
GD da Fonseca - arXiv preprint arXiv:2303.07696, 2023 - arxiv.org
We describe the heuristics used by the Shadoks team in the CG: SHOP 2023 Challenge.
The Challenge consists of 206 instances, each being a polygon with holes. The goal is to …
The Challenge consists of 206 instances, each being a polygon with holes. The goal is to …
Minimum coverage by convex polygons: The CG: SHOP challenge 2023
We give an overview of the 2023 Computational Geometry Challenge targeting the problem
Minimum Coverage by Convex Polygons, which consists of covering a given polygonal …
Minimum Coverage by Convex Polygons, which consists of covering a given polygonal …
An Overview of Minimum Convex Cover and Maximum Hidden Set
R Browne - arXiv preprint arXiv:2403.01354, 2024 - arxiv.org
We give a review of results on the minimum convex cover and maximum hidden set
problems. In addition, we give some new results. First we show that it is NP-hard to …
problems. In addition, we give some new results. First we show that it is NP-hard to …