Thijs van der Horst

most citedChromatic

k

-Nearest Neighbor Queries

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

cs.CG2026

Reconfiguration of Squares Using a Constant Number of Moves Each

Thijs van der Horst, Maarten Löffler, Tim Ophelders +1

Multi-robot motion planning is a hard problem. We investigate restricted variants of the problem where square robots are allowed to slide over an arbitrary curve to a new position…

cs.CG2022★ 1 cited

Chromatic $k$ -Nearest Neighbor Queries

Thijs van der Horst, Maarten Löffler, Frank Staals

Let $P$ be a set of $n$ colored points. We develop efficient data structures that store $P$ and can answer chromatic $k$ -nearest neighbor ( $k$ -NN) queries. Such a query consists of…

Reconfiguration of Squares Using a Constant Number of Moves Each

Chromatic k-Nearest Neighbor Queries

Chromatic $k$ -Nearest Neighbor Queries