20 citations · 41 across the 6 of their papers we have counts for
8 papers
Geodesic Order Types
Oswin Aichholzer, Matias Korman, Alexander Pilz +1
The geodesic between two points and in the interior of a simple polygon~ is the shortest polygonal path inside that connects to . It is thus the natural gener…
Helly Numbers of Polyominoes
Jean Cardinal, Hiro Ito, Matias Korman +1
We define the Helly number of a polyomino as the smallest number such that the -Helly property holds for the family of symmetric and translated copies of on the inte…
Balanced partitions of 3-colored geometric sets in the plane
Sergey Bereg, Matias Korman, Rodrigo I. Silveira +6
Let be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset is said to be \emph{balanced} if contains the same amount of e…
Line Segment Covering of Cells in Arrangements
Matias Korman, Sheung-Hung Poon, Marcel Roeloffzen
Given a collection of line segments, we consider its arrangement and study the problem of covering all cells with line segments of . That is, we want to find a minimum-size…
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs
Oswin Aichholzer, Thomas Hackl, Matias Korman +5
We consider the following question: How many edge-disjoint plane spanning trees are contained in a complete geometric graph on any set of points in general position…
Experimental Study of Compressed Stack Algorithms in Limited Memory Environments
Jean-François Baffier, Yago Diez, Matias Korman
The {\em compressed stack} is a data structure designed by Barba {\em et al.} (Algorithmica 2015) that allows to reduce the amount of memory needed by an algorithm (at the cost of…