7 citations · 11 across the 6 of their papers we have counts for
4 papers
Degree of Convexity and Expected Distances in Polygons
Mikkel Abrahamsen, Viktor Fredslund-Hansen
We present an algorithm for computing the so-called Beer-index of a polygon in time, where is the number of corners. The polygon may have holes. The Beer-index…
Irrational Guards are Sometimes Needed
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
In this paper we study the art gallery problem, which is one of the fundamental problems in computational geometry. The objective is to place a minimum number of guards inside a si…
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm +2
A graph is an induced universal graph for a family of graphs if every graph in is a vertex-induced subgraph of . For the family of all undirected graphs on verti…
Spiral Toolpaths for High-Speed Machining of 2D Pockets with or without Islands
Mikkel Abrahamsen
We describe new methods for the construction of spiral toolpaths for high-speed machining. In the simplest case, our method takes a polygon as input and a number and returns…