no code implementations • 5 Dec 2021 • Davide Dell'Anna, Natasha Alechina, Brian Logan, Maarten Löffler, Fabiano Dalpiaz, Mehdi Dastani
In this paper, we consider the problem of synthesising a norm from traces of agent behaviour, where each trace is labelled with whether the behaviour satisfies the system objective.
no code implementations • 11 Mar 2021 • Ankush Acharyya, Ramesh K. Jallu, Maarten Löffler, Gert G. T. Meijer, Maria Saumell, Rodrigo I. Silveira, Frank Staals, Hans Raj Tiwary
A viewshed is the union of all the parts of the terrain that are visible from a given viewpoint or set of viewpoints.
Computational Geometry 68U05
no code implementations • 24 Apr 2020 • Kevin Buchin, Chenglin Fan, Maarten Löffler, Aleksandr Popov, Benjamin Raichel, Marcel Roeloffzen
We prove that both the upper and lower bound problems are NP-hard for the continuous Fr\'echet distance in several uncertainty models, and that the upper bound problem remains hard for the discrete Fr\'echet distance.
Computational Geometry
1 code implementation • 28 Jun 2010 • David Eppstein, Maarten Löffler, Darren Strash
The degeneracy of an $n$-vertex graph $G$ is the smallest number $d$ such that every subgraph of $G$ contains a vertex of degree at most $d$.
Data Structures and Algorithms Discrete Mathematics F.2.2; G.2.2
