CG:SHOP is an annual geometric optimization challenge and the 2022 editi...
In this paper, we present our heuristic solutions to the problems of fin...
This paper describes the heuristics used by the Shadoks team for the CG:...
We consider an algorithmic problem inspired by the Battleship game. In t...
A set S ⊂Z^d is digital convex if conv(S) ∩Z^d = S, where conv(S) denote...
The potato-peeling problem (also known as convex skull) is a fundamental...