My main area of research is computational geometry. So far, I focussed on spatial data structures and motion planning.
Publications
sorted by dateAll articles are gnuzipped postscript files. When you click on a file name your Web browser may start a postscript viewer or may ask for a filename to save. In the latter case, pick a name ending in .ps.gz, then gunzip that name to get a .ps file for printing or previewing. If you have trouble, or need hardcopy, my email is verbarg@informatik.uni-wuerzburg.de
Knut Verbarg. Approximate Center Points in Dense Point Sets. Information Processing Letters., Elsevier, 1997. To appear.
Knut Verbarg. Planning of Fast and Secure Paths Using Simple Primitives In Robert C. Bolles, Horst Bunke, Hartmut Noltemeier, editors, Intelligent Robots - Sensing, Modeling and Planning, World Scientific Publishing, 1997. To appear.
Knut Verbarg and André Hensel. Hierarchical Motion Planning Using a Spatial Index. Technical Report, University of Würzburg, January 1996.
Knut Verbarg and Hartmut Noltemeier. Dynamic Environmental Modeling by the C-Tree. In Horst Bunke, Takeo Kanade, Hartmut Noltemeier, editors, Modelling and Planning for Sensor Based Intelligent Robot Systems, pages 3-22. World Scientific Publishing, 1995.
Knut Verbarg. The C-Tree: A Dynamically Balanced Spatial Index. In H. Hagen, G. Farin and H. Noltemeier, editors, Geometric Modelling, volume 10 of Computing Supplement, pages 323-340. Springer, 1995.
Andreas Beck, Paul Holaj, Hartmut Noltemeier and Knut Verbarg. Umweltmodellierung und Bewegungsplanung. In Schwerpunktthema: Robotik, volume1 of Informationstechnik und Technische Informatik, pages 46-56. Oldenburg, February 1994.
Hartmut Noltemeier, Knut Verbarg and Christian Zirkelbach. A Data Structure for Representing and Efficient Querying Large Scenes of Geometric Objects: MB* Trees. In G. Farin, H. Hagen and H. Noltemeier, editors, Geometric Modelling, volume 8 of Computing Supplement, pages 211-226. Springer, 1993.
Knut Verbarg. Searching Sequence Databases using the Monotonous Bisectortree. Technical report, European Molecular Biology Laboratory, Heidelberg, Germany, December 1992.
Knut Verbarg. Räumliche Indizes - Celltrees: Analyse und experimenteller Vergleich mit Monotonen Bisektorbäumen. Master's thesis, University of Würzburg, 1992.
Hartmut Noltemeier, Knut Verbarg and Christian Zirkelbach. Monotonous Bisector* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geomtric Objects. In B. Monien and Th. Ottmann, editors, Data Structures and Efficient Algorithms, volume 594 of Lecture Notes in Computer Science, pages 186-203. Springer, 1992.
ProjectsAndré Hensel, Knut Verbarg: Hierarchical Motion Planning Using a Spatial Index
The source code (gnuzipped tar-archive) of our implementation can be compiled with LEDA3.2. The program is tested on a SUN Sparc 20 under Solaris 2.4 and the Gnu-C++-Compiler g++.
Knut Verbarg (verbarg@informatik.uni-wuerzburg.de)