Ivor van der Hoog | DeepAI

DeepAI AI Chat

Featured Co-authors

Maarten Löffler
42 publications
Irina Kostitsyna
28 publications
Tillmann Miltzow
26 publications
Kevin Buchin
24 publications
Eva Rotenberg
23 publications
Anne Driemel
22 publications
Bettina Speckmann
21 publications
Irene Parada
20 publications
Chris Schwiegelshohn
18 publications
Frank Staals
17 publications
Marc van Kreveld
16 publications

∙ 12/14/2022

Data Structures for Approximate Discrete Fréchet Distance

The Fréchet distance is one of the most studied distance measures betwee...

0 Ivor van der Hoog, et al. ∙

∙ 09/28/2022

Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs

A directed graph G is upward planar if it admits a planar embedding such...

0 Ivor van der Hoog, et al. ∙

∙ 09/28/2022

Adaptive Out-Orientations with Applications

We give simple algorithms for maintaining edge-orientations of a fully-d...

0 Aleksander B. G. Christiansen, et al. ∙

∙ 09/28/2022

Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity

We study dynamic planar graphs with n vertices, subject to edge deletion...

0 Jacob Holm, et al. ∙

∙ 03/03/2022

Efficient Fréchet distance queries for segments

We study the problem of constructing a data structure that can store a t...

0 Maike Buchin, et al. ∙

∙ 01/10/2022

Segment Visibility Counting Queries in Polygons

Let P be a simple polygon with n vertices, and let A be a set of m point...

0 Kevin Buchin, et al. ∙

∙ 01/06/2022

On the Discrete Fréchet Distance in a Graph

The Fréchet distance is a well-studied similarity measure between curves...

0 Anne Driemel, et al. ∙

∙ 01/15/2021

Preprocessing Imprecise Points for the Pareto Front

In the preprocessing model for uncertain data we are given a set of regi...

0 Ivor van der Hoog, et al. ∙

∙ 12/04/2019

A Framework for Robust Realistic Geometric Computations

We propose a new paradigm for robust geometric computations that complem...

0 Jeff Erickson, et al. ∙

∙ 07/10/2019

Smoothed Analysis of Order Types

Consider an ordered point set P = (p_1,...,p_n), its order type (denoted...

0 Ivor van der Hoog, et al. ∙

∙ 03/19/2019

Preprocessing Ambiguous Imprecise Points

Let R = {R_1, R_2, ..., R_n} be a set of regions and let X = {x_1, x_2,...

0 Ivor van der Hoog, et al. ∙

∙ 10/01/2018

Topological Stability of Kinetic k-Centers

We study the k-center problem in a kinetic setting: given a set of conti...

0 Ivor van der Hoog, et al. ∙

∙ 12/15/2017

Dynamic smooth compressed quadtrees (Fullversion)

We introduce dynamic smooth (a.k.a. balanced) compressed quadtrees with ...

0 Ivor van der Hoog, et al. ∙

∙ 08/02/2017

Maximum-Area Quadrilateral in a Convex Polygon, Revisited

In this note we show by example that the algorithm presented in 1979 by ...

0 Vahideh Keikha, et al. ∙

∙ 05/31/2017

Maximum-Area Triangle in a Convex Polygon, Revisited

We revisit the following problem: Given a convex polygon P, find the lar...

0 Vahideh Keikha, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world