Ivor van der Hoog

activity

20172022

collaborators

4 papers

cs.CG2022

Segment Visibility Counting Queries in Polygons

Kevin Buchin, Bram Custers, Ivor van der Hoog +4

Let $P$ be a simple polygon with $n$ vertices, and let $A$ be a set of $m$ points or line segments inside $P$ . We develop data structures that can efficiently count the number of o…

cs.CG2021

Preprocessing Imprecise Points for the Pareto Front

Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler +1

In the preprocessing model for uncertain data we are given a set of regions R which model the uncertainty associated with an unknown set of points P. In this model there are two ph…

cs.CG2019

Preprocessing Ambiguous Imprecise Points

Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler +1

Let $R = {R_{1}, R_{2}, ..., R_{n}}$ be a set of regions and let $X = {x_{1}, x_{2}, ..., x_{n}}$ be an (unknown) point set with $x_{i} \in R_{i}$ . Region $R_{i}$ represents the uncertainty r…

cs.CG2017

Maximum-Area Quadrilateral in a Convex Polygon, Revisited

Vahideh Keikha, Maarten Löffler, Ali Mohades +2

In this note we show by example that the algorithm presented in 1979 by Dobkin and Snyder for finding the largest-area k-gon that is inscribed in a convex polygon fails to find the…