 |
[ ][ ]
|
| Computer Science Dept. I | Masters theses |
|
|
[][]
|
| Computer Science Dept. I | Masters theses |
| Examples for open theses | |
|---|---|
| Subject | Tutor |
| Our diploma thesis come mostly from the areas computational geometry, robot motion planning and online algorihms. |
Prof. Dr. Rolf Klein Dr. Elmar Langetepe Florian Berger Alexander Gilbers |
| Theses in preparation | |
| Subject | Student |
| Iteration the Voronoi Diagram | Artyom Chernyshov |
| k-Agent Exploration on Trees | Daniel Jung |
| A scripting language for lion search games | Mathias Thurn |
| Inspection Path Queries for several points | Desmond Onuh |
| Variants of Ray Searching | Elitsa Dimitrova |
| Visibility between polygonal chains | Andreas Lenerz |
| A Stable Implementation of the Red Blue Merge | Jannis Warnat |
| Explorations in Grids | Anselm Hoffmeister |
| Shortest Watchman Route with two Agents | Simone Lehmann |
| An Applet for Computing Volumes | Borislav Manolov |
| Comparison and implementation of covering algorithms | Adrian Hanslik |
| Finished theses | |
| 2009 | Student |
| Graph Classification | Tobias Lindemann |
| An Applet That Computes A WSPD | Joaquim L. Miala |
| Optimal Search Paths | Jürg Wegener |
| Motion Planning in the Presence of Moving Objects | Christoph Miebach |
| A Geometric Model for Shepherding | Georg Kaiser |
| Search Paths for Robots with Bounded Vision | Florian Bongartz |
| TSP Variants with polynomial running time | Ziad Chehimi |
| Lower bounds for geometric problems | Anja Haupts |
| 2008 | Student |
| Two-guard problem with Khepera III | Adalbert Prokop |
| Curves with bounded detour | Thomas Krümmel |
| Fixed Frechet Distance | Pit Prüßner |
| Online Carcassone | Oliver Spata |
| The lions problem on graphs | Rainer Penninger |
| Exploration with mixed costs measure | Andreas Thies |
| Computing the geometric dilation of a graph efficiently | Duy-Hung Nuygen |
| Observing stripes | Thomas Jach |
| Exploring triangular and hexagonal grids | Daniel Herrmann |
| 2007 | Student |
| Competitive motion planning dealing with failing edges |
Sebastian Jacobi, Manuel Wedemeier |
| Kinetik geometric data structures | Alexander Andruschenko |
| Optimal search strategies for small stars | Maximilian Weber |
| Optimal position of a new highway | Rainer Montignies |
| PolyExplore (with bounded depth) | Karl Czaputa |
| Searcher and intruder problems | Duc Luu |
| Recent results on the k-server problem | Mirjana Perkovic |
| SWR in pseudo-orthogonal polygons | Max Kalina |
| A survey on Persuit/Evasion Problems | Christoph Koch |
| 2006 | Student |
| Escaping an unknown environment with a small robot | Bernd Brüggemann |
| Implementierung und Evaluation der Explorationsstrategie PolyExplore auf einem mobilen Robotersystem | Alexander Tiderko |
| Searching for the kernel of a terrain | Marina Bachran |
| Dilation-free graphs with few self-intersections | Alexander Hess |
| Computation of Minimum Manhattan Networks | Martin Köhler |
| Building a triangulation from a distance matrix | Daniel Krämer |
| Voronoi diagrams in 3D and on a sphere | Christoph Baudson |
| Sensorfree orientation with the Edu Bot 250 | Thorsten Baumgartner |
| Computing a minimum dilation triangulation efficiently | Alexander Klein |
| Voronoi diagrams in 3D and on a sphere | Edgar Klein |
| Generic dynamization of data structures | Levent Yazgan |
| 2005 | Student |
| The problem of the longest ladder | Markus Rings |
| The Voronoi game | Csilla Bükki |
| On the density of iterated segment intersections | Sanaz Kamali |
| Imbedding finite point sets with small dilation | Daniel Lorenz |
| Graph-theoretic dilation of Delaunay-triangulations and related graphs | Tom Dickmeiß |
| Robots with restricted orientation | Birgit Engels |
| Motion planning for convex robots with rotation and translation | Natalia Tanatarova |
| Exploration of 3D cellular environments | Christine Dienelt |
| Smallest color-spanning rectangles | Andreas Lotz |
| Optimizing assets with genetic algorithms | Runquiu Song |
| 2004 | Student |
| Maximum detour and restricting angle of polygonal chains | Maria Margarida Pinheiro de Castro Neves |
| Computing the graph-theoretic dilation of a graph | Tim Komorowski |
| 2003 | Student |
| Heuristics for TSP in 3D | Bernhard Reichmann |
| 2002 | Student |
| Detour inside polygons | Ansgar Grüne |
| A java applet to visualize the calculation of the lower envelope | Hossein Zahedi |
| Lower bounds for exploration problems | Roland Hagius |
| 2001 | Student |
| A java applet for the online TSP problem | Michael Weber |
| A java applet for memory allocation and paging algorithms | Franco Pitta |
| more | |
[ GeomLab ]
© Universität Bonn, Informatik Abt. I - webmaster - Letzte Änderung: Fri Oct 30 15:06:27 2009