max planck institut
informatik

# MPI-INF or MPI-SWS or Local Campus Event Calendar

 << Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
Title: Semi-dynamic connectivity in the plane Michael Kerber Max-Planck-Institut für Informatik - D1 AG1 Mittagsseminar (own work) D1, D2, D3, D4, D5, RG1, SWS, MMCIWe use this to send out email in the morning. AG Audience English
Date: Tuesday, 14 April 2015 13:00 30 Minutes Saarbrücken E1 4 024
 Motivated by a path planning problem we consider the following procedure. Assume that we have two points $s$ and $t$ in the plane and take $\calK=\emptyset$. At each step we add to $\calK$ a compact convex set that does not contain $s$ nor $t$. The procedure terminates when the sets in $\calK$ separate $s$ and $t$. We show how to add one set to $\calK$ in $O(1+k\alpha(n))$ amortized time plus the time needed to find all sets of $\calK$ intersecting the newly added set, where $n$ is the cardinality of $\calK$, $k$ is the number of sets in $\calK$ intersecting the newly added set, and $\alpha(\cdot)$ is the inverse of the Ackermann function.
Name(s): Michael Kerber