Nacionalni portal odprte znanosti

We study the problem of searching for a target at some unknown location in ▫${\mathbb R}^d$▫ when additional information regarding the position of the target is available in the form of predictions. In our setting, predictions come as approximate distances to the target: for each point ▫$p \in {\mat ...

We investigate algorithms with predictions in computational geometry, specifically focusing on the basic problem of computing 2D Delaunay triangulations. Given a set ▫$P$▫ of ▫$n$▫ points in the plane and a triangulation ▫$G$▫ that serves as a "prediction" of the Delaunay triangulation, we would lik ...