ML p(r)ior | Marcel Roeloffzen

Articles of Marcel Roeloffzen

Is it you?
2019-02-18

Let $P$ be an $x$-monotone orthogonal polygon with $n$ vertices. We call $P$ a simple histogram if i… show more
PDF

Highlights - Most important sentences from the article

2017-03-28

We consider the problem of routing a data packet through the visibility graph of a polygonal domain … show more
PDF

Highlights - Most important sentences from the article

2017-03-08

We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we… show more
PDF

Highlights - Most important sentences from the article

2017-03-17

Given a set of points in the plane, we want to establish a connection network between these points t… show more
PDF

Highlights - Most important sentences from the article

2017-01-12

We introduce the fully-dynamic conflict-free coloring problem for a set $S$ of intervals in $\mathbb… show more
PDF

Highlights - Most important sentences from the article

2017-08-02

Let $P$ be a planar set of $n$ sites in general position. For $k\in\{1,\dots,n-1\}$, the Voronoi dia… show more
PDF

Highlights - Most important sentences from the article

2017-09-08

We prove a geometric version of the graph separator theorem for the unit disk intersection graph: fo… show more
PDF

Highlights - Most important sentences from the article

2015-07-13

Let $S$ be a planar $n$-point set. A triangulation for $S$ is a maximal plane straight-line graph wi… show more
PDF

Highlights - Most important sentences from the article

2016-03-07

In this paper we study a cooperative card game called Hanabi from the viewpoint of algorithmic combi… show more
PDF

Highlights - Most important sentences from the article

2015-07-08

We show that for any set of $n$ points moving along "simple" trajectories (i.e., each coordinate is … show more
PDF

Highlights - Most important sentences from the article

2017-08-30

In this paper we study the number of vertex recolorings that an algorithm needs to perform in order … show more
PDF

Highlights - Most important sentences from the article

2017-12-15

We study the computation of the diameter and radius under the rectilinear link distance within a rec… show more
PDF

Highlights - Most important sentences from the article

2017-08-02

Given a collection $L$ of line segments, we consider its arrangement and study the problem of coveri… show more
PDF

Highlights - Most important sentences from the article

2015-09-25

An $s$-workspace algorithm is an algorithm that has read-only access to the values of the input, wri… show more
PDF

Highlights - Most important sentences from the article

2017-02-28

We present a new algorithm for the widely used density-based clustering method DBscan. Our algorithm… show more
PDF

Highlights - Most important sentences from the article

2016-02-02

Let $\mathcal{S}$ be a connected planar polygonal subdivision with $n$ edges that we want to preproc… show more
PDF

Highlights - Most important sentences from the article