- Exploring Simple Grid Polygons Christian Icking1
- Rheinische Friedrich-Wilhelms-Universitat Bonn Institut fur Informatik I
- arXiv:math.MG/0407135v225Aug2005 On the Geometric Dilation of Closed Curves, Graphs,
- Inspecting a Set of Strips Optimally Tom Kamphans
- Abstract Voronoi Diagrams Revisited Elmar Langetepe
- EUROGRAPHICS 2002 Tutorial Geometric Data Structures for Computer Graphics
- Exploring Simple Triangular and Hexagonal Grid Polygons Online Daniel Herrmann
- Optimizing two-sequence functionals in competitive analysis Elmar Langetepe
- The weighted farthest color Voronoi diagram on trees and [Extended Abstract]
- Rheinische Friedrich-Wilhelms-Universitt Bonn Institut fr Informatik I
- Competitive Online Searching for a Ray in the Plane Andrea Eubeler
- Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles
- Optimal Competitive Online Ray Search with an Error-Prone Robot
- Competitive Online Approximation of the Optimal Search Ratio
- Embedding Point Sets into Plane Graphs of Small Dilation Annette Ebbers-Baumann
- Competitive Online Approximation of the Optimal Search Ratio Rudolf Fleischer
- On the optimality of spiral search Elmar Langetepe
- On the Density of Iterated Line Segment Intersections
- On the Density of Iterated Line Segment Intersections
- December 14, 2006 17:15 WSPC/Guidelines AllBoundsArticle International Journal of Computational Geometry & Applications
- Competitive Online Searching for a Ray in the Andrea Eubeler
- Path Planning with spatial and temporal Constraints
- On the Geometric Dilation of Finite Point Sets Annette Ebbers-Baumann, Ansgar Grune, and Rolf Klein
- Rheinische Friedrich-Wilhelms-Universitat Bonn Institut fur Informatik I
- Computing the Detour of Polygonal Curves Pankaj K. Agarwal, Rolf Klein,
- Searching for an axis-parallel shoreline Elmar Langetepe
- Leaving an Unknown Maze Using an Error-Prone Tom Kamphans, Elmar Langetepe
- CHORDS HALVING THE AREA OF A PLANAR CONVEX SET , R. Klein2
- DOI: 10.1007/s00453-005-1203-9 Algorithmica (2006) 44: 137149
- On the Optimality of Spiral Search Elmar Langetepe
- EuroCG 2010, Dortmund, Germany, March 2224, 2010 Computing the visibility area between two simple polygons in linear time
- Inspecting a Set of Strips Optimally Tom Kamphans1
- On the Optimality of Spiral Search Elmar Langetepe
- Leaving an Unknown Maze with One-Way Roads Bernd Bruggemann
- Randolphs Robot Game is NP-complete! Birgit Engels
- On Geometric Dilation and Halving Chords Adrian Dumitrescu1
- Improved Lower Bound on the Geometric Dilation of Point Sets Adrian Dumitrescu
- Embedding Point Sets into Plane Graphs of Small Dilation
- On optimizing multi-sequence functionals for competitive analysis Tom Kamphans
- Geometric dilation of closed planar curves: A new lower bound Annette Ebbers-Baumann a
- Computing the Detour of Polygons Ansgar Grune Rolf Klein Elmar Langetepe
- The Pledge Algorithm Reconsidered under Errors in Sensors and Motion
- Rheinische Friedrich-Wilhelms-Universitat Bonn Institut fur Informatik I
- Rheinische Friedrich-Wilhelms-Universitat Bonn Institut fur Informatik I
- Rheinische Friedrich-Wilhelms-Universitat Bonn Institut fur Informatik I
- Rheinische Friedrich-Wilhelms-Universitat Bonn Institut fur Informatik I
- Inspecting a set of strips optimally Tom Kamphans and Elmar Langetepe
- Geometric Dilation of Closed Planar Curves: New Lower Bounds
