A (multi)set of segments in the plane may form a TSP tour, a matching, a...
Approximating convex bodies is a fundamental question in geometry and ha...
We present a new approach to approximate nearest-neighbor queries in fix...
CG:SHOP is an annual geometric optimization challenge and the 2022 editi...
Coverings of convex bodies have emerged as a central component in the de...
We describe the heuristics used by the Shadoks team in the CG:SHOP 2023
...
A set of segments in the plane may form a Euclidean TSP tour or a matchi...
Given a matching between n red points and n blue points by line segments...
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...
Convex bodies play a fundamental role in geometric computation, and
appr...
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...
Approximation problems involving a single convex body in d-dimensional
s...