AI Chat AI Image Generator AI Video Text to Speech

Shadoks Approach to Convex Covering

03/14/2023

∙

by Guilherme D. da Fonseca, et al.

∙

∙

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 cover each instance polygon with a small number of convex polygons. Our general strategy is the following. We find a big collection of large (often maximal) convex polygons inside the instance polygon and then solve several set cover problems to find a small subset of the collection that covers the whole polygon.

page 1

page 3

page 5

page 7

research

∙ 05/17/2023

Convex Cover and Hidden Set in Funnel Polygons

We present linear-time algorithms for both maximum hidden set and minimu...

0 Reilly Browne, et al. ∙

research

∙ 06/04/2021

Covering Polygons is Even Harder

In the MINIMUM CONVEX COVER (MCC) problem, we are given a simple polygon...

0 Mikkel Abrahamsen, et al. ∙

research

∙ 11/13/2017

On Partial Covering For Geometric Set Systems

We study a generalization of the Set Cover problem called the Partial Se...

0 Tanmay Inamdar, et al. ∙

research

∙ 03/13/2023

Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023

We give an overview of the 2023 Computational Geometry Challenge targeti...

0 Sandor P. Fekete, et al. ∙

research

∙ 05/06/2016

Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles

Given a simple graph G=(V,E), a subset of E is called a triangle cover i...

0 Xujin Chen, et al. ∙

research

∙ 04/06/2020

Directional approach to gradual cover: the continuous case

The objective of the cover location models is covering demand by facilit...

0 Tammy Drezner, et al. ∙

research

∙ 06/26/2018

On Representer Theorems and Convex Regularization

We establish a general principle which states that regularizing an inver...

0 Claire Boyer, et al. ∙