#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2007

2018

- This year (4)
- Last 5 years (17)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Mikkel Abrahamsen
- CCCG
- 2013

Let P be a simple polygon with n vertices. We present a new O(n)-time algorithm to compute the visible part of one edge from another edge of P . The algorithm does not alter the input and only uses… (More)

- Mikkel Abrahamsen
- Symposium on Computational Geometry
- 2015

We describe an algorithm for computing the separating common tangents of two simple polygons using linear time and only constant workspace. A tangent of a polygon is a line touching the polygon such… (More)

- Mikkel Abrahamsen, Søren Eilers
- Experimental Mathematics
- 2011

We prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial equations over the real numbers has a solution. The art gallery problem… (More)

- Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
- Symposium on Computational Geometry
- 2017

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 simple polygon so… (More)

- Mikkel Abrahamsen, Bartosz Walczak
- ESA
- 2016

We describe the first algorithm to compute the outer common tangents of two disjoint simple polygons using linear time and only constant workspace. A tangent of a polygon is a line touching the… (More)

- Mikkel Abrahamsen, Gregory Bodwin, Eva Rotenberg, Morten Stöckel
- STACS
- 2016

Graph reconstruction algorithms seek to learn a hidden graph by repeatedly querying a blackbox oracle for information about the graph structure. Perhaps the most well studied and applied version of… (More)

We investigate experimentally the growth regimes of the number of LEGO structures which can be constructed contiguously from n blocks of equal shape and color.

- Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
- STOC
- 2018

We prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial equations over the real numbers has a solution. The art gallery problem… (More)

- Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi
- Symposium on Computational Geometry
- 2017

In a geometric k-clustering problem the goal is to partition a set of points in R into k subsets such that a certain cost function of the clustering is minimized. We present data structures for… (More)