Mikkel Abrahamsen

activity

20152023

\exists R

-complete

11 citations · 60 across the 20 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.CG2022★ 1 cited

Partitioning a Polygon Into Small Pieces

Mikkel Abrahamsen, Nichlas Langhoff Rasmussen

We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for const…

cs.CG2022

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 $P$ in $O (n^{2})$ time, where $n$ is the number of corners. The polygon $P$ may have holes. The Beer-index…