31 citations · 157 across the 51 of their papers we have counts for
3 papers · 1 filter
Geodesic-Preserving Polygon Simplification
Oswin Aichholzer, Thomas Hackl, Matias Korman +2
Polygons are a paramount data structure in computational geometry. While the complexity of many algorithms on simple polygons or polygons with holes depends on the size of the inpu…
Cannibal Animal Games: a new variant of Tic-Tac-Toe
Jean Cardinal, Sébastien Collette, Hiro Ito +4
This paper presents a new partial two-player game, called the \emph{cannibal animal game}, which is a variant of Tic-Tac-Toe. The game is played on the infinite grid, where in each…
On the Complexity of Barrier Resilience for Fat Regions
Matias Korman, Maarten Löffler, Rodrigo I. Silveira +1
In the \emph {barrier resilience} problem (introduced by Kumar {\em et al.}, Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we…