Geometric data structures for computer graphics G Zachmann, E Langetepe Eurographics (Tutorials), 2002 | 76 | 2002 |

The farthest color Voronoi diagram and related problems M Abellanas, F Hurtado, C Icking, R Klein, E Langetepe, L Ma, B Palop, ... Abstracts 17th European Workshop Comput. Geom, 113-116, 2001 | 69 | 2001 |

Geometric data structures for computer graphics E Langetepe, G Zachmann AK Peters/CRC Press, 2006 | 64 | 2006 |

Smallest color-spanning objects M Abellanas, F Hurtado, C Icking, R Klein, E Langetepe, L Ma, B Palop, ... European Symposium on Algorithms, 278-289, 2001 | 61 | 2001 |

Abstract Voronoi diagrams revisited R Klein, E Langetepe, Z Nilforoushan Computational Geometry 42 (9), 885-902, 2009 | 55 | 2009 |

On the competitive complexity of navigation tasks C Icking, T Kamphans, R Klein, E Langetepe Sensor Based Intelligent Robots, 245-258, 2002 | 55 | 2002 |

Voronoi diagram for services neighboring a highway M Abellanas, F Hurtado, V Sacristán, C Icking, L Ma, R Klein, ... Information Processing Letters 86 (5), 283-288, 2003 | 53 | 2003 |

Self-approaching curves C Icking, R Klein, E Langetepe Mathematical Proceedings of the Cambridge Philosophical Society 125 (3), 441-453, 1999 | 50 | 1999 |

A fast algorithm for approximating the detour of a polygonal chain A Ebbers-Baumann, R Klein, E Langetepe, A Lingas Computational Geometry 27 (2), 123-134, 2004 | 41 | 2004 |

An optimal competitive strategy for walking in streets C Icking, R Klein, E Langetepe Annual Symposium on Theoretical Aspects of Computer Science, 110-120, 1999 | 39 | 1999 |

On the optimality of spiral search E Langetepe Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 38 | 2010 |

Exploring simple grid polygons C Icking, T Kamphans, R Klein, E Langetepe International Computing and Combinatorics Conference, 524-533, 2005 | 37 | 2005 |

Generalized self-approaching curves O Aichholzer, F Aurenhammer, C Icking, R Klein, E Langetepe, G Rote Discrete Applied Mathematics 109 (1-2), 3-24, 2001 | 36 | 2001 |

How to find a point on a line within a fixed distance C Hipke, C Icking, R Klein, E Langetepe Discrete Applied Mathematics 93 (1), 67-73, 1999 | 35 | 1999 |

Competitive online approximation of the optimal search ratio R Fleischer, T Kamphans, R Klein, E Langetepe, G Trippen SIAM Journal on Computing 38 (3), 881-898, 2008 | 34 | 2008 |

Exploring an Unknown Cellular Environment. C Icking, T Kamphans, R Klein, E Langetepe EuroCG, 140-143, 2000 | 24 | 2000 |

Proximity problems for time metrics induced by the L1 metric and isothetic networks M Abellanas, F Hurtado, C Icking, R Klein, E Langetepe, L Ma, B Palop, ... | 22 | 2001 |

An optimal competitive strategy for walking in streets C Icking, R Klein, E Langetepe, S Schuierer, I Semrau SIAM Journal on Computing 33 (2), 462-486, 2004 | 21 | 2004 |

Competitive online approximation of the optimal search ratio R Fleischer, T Kamphans, R Klein, E Langetepe, G Trippen European Symposium on Algorithms, 335-346, 2004 | 18 | 2004 |

Exploring simple triangular and hexagonal grid polygons online D Herrmann, T Kamphans, E Langetepe arXiv preprint arXiv:1012.5253, 2010 | 15 | 2010 |