Logo - Fakultät LG Logo
 

apl. Prof. Dr. Christian Icking

Christian Icking
E-Mail: christian.icking
Telefon: +49 2331 987 - 4330
Fax: +49 2331 987 - 313
Raum: IZ, 2. OG, G11

Studium und Beruf

  • Studium der Mathematik und der Informatik in Münster und Paris
  • Maîtrise de Mathématiques et Appliquations Fondamentales, Université Pierre et Marie Curie Paris VI
  • Diplôme d'Études Approfondies (DEA) d'Informatique, Ecole Nationale Supérieure de Techniques Avançées Paris
  • Wissenschaftlicher Mitarbeiter an den Universitäten Karlsruhe, Freiburg, Essen und Hagen
  • Promotion und Habilitation in Informatik, FernUniversität Hagen

Forschungsgebiete

  • Algorithmische Geometrie, siehe auch die GI-Fachgruppe
  • Online-Algorithmen

Betreute Arbeiten

Bachelor-Arbeiten

Master-Arbeiten

Diplomarbeiten

Publikationen

  • Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe
    Exploring Simple Grid Polygons
    11th International Computing and Combinatorics Conference, Kunming, China,
    Lecture Notes Comput. Sci. 3595, Springer-Verlag, 2005, pp. 524-533.
  • Manuel Abellanas, Ferran Hurtado, Christian Icking, Lihong Ma, Belén Palop, Pedro A. Ramos
    Best Fitting Rectangles
    Technical Report 322, FernUniversität Hagen, Department of Computer Science, Germany, 2004.
  • Christian Icking, Rolf Klein, Elmar Langetepe, Sven Schuierer, Ines Semrau
    An Optimal Competitive Strategy for Walking in Streets
    SIAM J. Comput. 33(2), pp. 462-486, 2004.
  • Roland Hagius, Christian Icking, Elmar Langetepe
    Lower Bounds for the Polygon Exploration Problem
    Abstracts 20th European Workshop Comput. Geom., Sevilla, Universitat de Sevilla, 2004, pp. 135-138.
  • Manuel Abellanas, Ferran Hurtado, Christian Icking, Lihong Ma, Belén Palop, Pedro A. Ramos
    Best Fitting Rectangles
    Abstracts 19th European Workshop Comput. Geom., Bonn, Universität Bonn, 2003, pp. 147-150.
  • Manuel Abellanas, Ferran Hurtado, Vera Sacristán, Christian Icking, Lihong Ma, Rolf Klein, Elmar Langetepe, Belén Palop
    Voronoi Diagrams for Services Neighboring a Highway
    Inform. Process. Lett. 86, pp. 283-288, 2003.
  • Christian Icking, Rolf Klein, Peter Köllner, Lihong Ma
    Java Applets for the Dynamic Visualization of Voronoi Diagrams
    In Computer Science in Perspective, edited by Rolf Klein, Hans-Werner Six, Lutz Wegner, Lecture Notes Comput. Sci. 2598, Springer-Verlag, 2003, pp. 191-205.
  • Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe
    On the Competitive Complexity of Navigation Tasks
    Sensor Based Intelligent Robots,
    Lecture Notes Comput. Sci. 2238, Springer-Verlag, 2002, pp. 245-258.
  • Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
    Generalized Self-Approaching Curves
    Discrete Appl. Math. 109, pp. 3-24, 2001.
  • Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristán
    The Farthest Color Voronoi Diagram and Related Problems
    Abstracts 17th European Workshop Comput. Geom., Berlin, Freie Universität Berlin, 2001, pp. 113-116.
  • Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristán
    Smallest Color-Spanning Objects
    Proc. 9th Annu. European Sympos. Algorithms,
    Lecture Notes Comput. Sci. 2161, Springer-Verlag, 2001, pp. 278-289.
  • Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    The Polygon Exploration Problem
    SIAM J. Comput. 31, pp. 577-600, 2001.
  • Christian Icking, Rolf Klein, Lihong Ma, Stefan Nickel, Ansgar Weißler
    On Bisectors for Different Distance Functions
    Discrete Appl. Math. 109, pp. 139-161, 2001.
  • Christian Icking, Lihong Ma
    A Tight Bound for the Complexity of Voronoi Diagrams under Polyhedral Convex Distance Functions in 3D
    Proc. 33rd Annu. ACM Sympos. Theory Comput., Crete, Greece, 2001, pp. 316-321.
  • Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristán
    Diagrama de Voronoi del color más lejano y problemas relacionados
    Actas de los IX Encuentros en Geometría Computacional, Girona, Institut d'Informática i Aplicacions, Universitat de Girona, 2001, pp. 51-54.
  • Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristán
    Proximity Problems for Time Metrics Induced by the L1 Metric and Isothetic Networks
    Actas de los IX Encuentros en Geometría Computacional, Girona, Institut d'Informática i Aplicacions, Universitat de Girona, 2001, pp. 175-181.
  • Christian Icking
    Algorithms and Structures for Exploration and Distance Problems
    Habilitationsschrift, FernUniversität Hagen, Department of Computer Science, 2001.
  • Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe
    Exploring an Unknown Cellular Environment
    Abstracts 16th European Workshop Comput. Geom., Eilat, Ben-Gurion University of the Negev, 2000, pp. 140-143.
  • Amitava Datta, Christian Icking
    Competitive Searching in a Generalized Street
    Comput. Geom. Theory Appl. 13, pp. 109-120, 1999.
  • Christoph Hipke, Christian Icking, Rolf Klein, Elmar Langetepe
    How to Find a Point on a Line within a Fixed Distance
    Discrete Appl. Math. 93, pp. 67-73, 1999.
  • Christian Icking, Rolf Klein, Elmar Langetepe
    An Optimal Competitive Strategy for Walking in Streets
    Proc. 16th Sympos. Theoret. Aspects Comput. Sci., Trier,
    Lecture Notes Comput. Sci. 1563, Springer-Verlag, 1999, pp. 110-120.
  • Christian Icking, Rolf Klein, Elmar Langetepe
    Self-Approaching Curves
    Math. Proc. Camb. Phil. Soc. 125, pp. 441-453, 1999.
  • Christian Icking, Rolf Klein, Elmar Langetepe
    Searching a Goal on m Rays Within a Fixed Distance
    Abstracts 15th European Workshop Comput. Geom., Antibes, INRIA Sophia-Antipolis, 1999, pp. 137-139.
  • Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma, Francisco Santos
    On Bisectors for Convex Distance Functions in 3-Space
    Proc. 11th Canad. Conf. Comput. Geom., Vancouver, Canada, 1999.
  • Christian Icking, Rolf Klein, Lihong Ma, Stefan Nickel, Ansgar Weißler
    On Bisectors for Different Distance Functions
    Proc. 15th Annu. ACM Sympos. Comput. Geom., 1999, pp. 291-299.
  • Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    The Polygon Exploration Problem II: The Angle Hull
    Technical Report 245, FernUniversität Hagen, Department of Computer Science, Germany, 1998.
  • Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    The Polygon Exploration Problem I: A Competitive Strategy
    Technical Report 241, FernUniversität Hagen, Department of Computer Science, Germany, 1998.
  • Christian Icking, Alejandro López-Ortiz, Sven Schuierer, Ines Semrau
    Going Home Through an Unknown Street
    Technical Report 228, FernUniversität Hagen, Department of Computer Science, Germany, 1998.
  • Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
    Generalized Self-Approaching Curves
    Abstracts 14th European Workshop Comput. Geom., Barcelona, Universitat Polytènica de Catalunya, Barcelona, 1998, pp. 15-17.
  • Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
    Generalized Self-Approaching Curves
    Proc. 9th Annu. Internat. Sympos. Algorithms Comput., Taejon,
    Lecture Notes Comput. Sci. 1533, Springer-Verlag, 1998, pp. 317-326.
  • Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    Moving an Angle Around a Region
    Proc. 6th Scand. Workshop Algorithm Theory, Stockholm,
    Lecture Notes Comput. Sci. 1432, Springer-Verlag, 1998, pp. 71-82.
  • Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    The Polygon Exploration Problem: A New Strategy and a New Analysis Technique
    Robotics: The Algorithmic Perspective, Proc. 3rd Workshop Algorithmic Found. Robot., Houston, A. K. Peters, 1998, pp. 211-222.
  • Christian Icking, Rolf Klein, Lihong Ma
    The Bisector with Respect to Different Convex Distance Functions
    Abstracts 14th European Workshop Comput. Geom., Barcelona, Universitat Polytènica de Catalunya, Barcelona, 1998, pp. 99-101.
  • Christian Icking, Rolf Klein, Elmar Langetepe
    Searching for the Kernel of a Polygon: A Competitive Strategy Using Self-Approaching Curves
    Technical Report 211, FernUniversität Hagen, Department of Computer Science, Germany, 1997.
  • Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    A Competitive Strategy for Learning a Polygon
    Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 166-174.
  • Christian Icking, Rolf Klein, Peter Köllner, Lihong Ma
    A Java Applet for the Dynamic Visualization of Voronoi Diagrams
    Abstracts 13th European Workshop Comput. Geom., Würzburg, Universität Würzburg, 1997, pp. 46-47.
  • Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    An Efficient Competitive Strategy for Learning a Polygon
    Abstracts 12th European Workshop Comput. Geom., Münster, Universität Münster, 1996, pp. 107-108.
  • Christian Icking, Rolf Klein
    Competitive Strategies for Autonomous Systems
    In Modelling and Planning for Sensor Based Intelligent Robot Systems, edited by H. Bunke, T. Kanade, H. Noltemeier, World Scientific, Singapore, 1995, pp. 23-40.
  • Christian Icking, Rolf Klein
    Searching for the Kernel of a Polygon: A Competitive Strategy
    Proc. 11th Annu. ACM Sympos. Comput. Geom., 1995, pp. 258-266.
  • Christian Icking, Rolf Klein
    Searching for the Kernel of a Polygon: A Competitive Strategy
    Abstracts 11th European Workshop Comput. Geom., Linz, Universität Linz, 1995, pp. 7-99.
  • Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma
    Convex Distance Functions in 3-Space are Different
    Fundam. Inform. 22, pp. 331-352, 1995.
  • Christian Icking, Rolf Klein, Lihong Ma
    An Optimal Competitive Strategy for Looking Around a Corner
    Technical Report 167, FernUniversität Hagen, Department of Computer Science, Germany, 1994.
  • Amitava Datta, Christian Icking
    Competitive Searching in a Generalized Street
    Proc. 10th Annu. ACM Sympos. Comput. Geom., 1994, pp. 175-182.
  • Christian Icking
    Motion and Visibility in Simple Polygons
    Dissertation, FernUniversität Hagen, Department of Computer Science, 1994.
  • Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma
    Convex Distance Functions in 3-Space are Different
    Proc. 9th Annu. ACM Sympos. Comput. Geom., 1993, pp. 116-123.
  • Christian Icking, Rolf Klein, Lihong Ma
    How to Look Around a Corner
    Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 443-448.
  • Christian Icking, Rolf Klein, Lihong Ma
    The Optimal Way for Looking Around a Corner
    Proc. 4th IEEE-IEE Vehicle Navigation and Informations Systems Conference, Ottawa, Canada, 1993.
  • Christian Icking, Günter Rote, Emo Welzl, Chee Yap
    Shortest Paths for Line Segments
    Algorithmica 10, pp. 182-200, 1993.
  • Christian Icking, Rolf Klein
    The Two Guards Problem
    Internat. J. Comput. Geom. Appl. 2(3), pp. 257-285, 1992.
  • Christian Icking, Rolf Klein
    Path Planning Under Uncertainty
    Abstracts 8th European Workshop Comput. Geom., Utrecht, Utrecht University, 1992, pp. 5.
  • Bengt J. Nilsson, Thomas Ottmann, Sven Schuierer, Christian Icking
    Restricted Orientation Computational Geometry
    In Data Structures and Efficient Algorithms, edited by Burkhard Monien, Thomas Ottmann, Lecture Notes Comput. Sci. 594, Springer-Verlag, 1992, pp. 148-185.
  • Christian Icking, Rolf Klein
    The Two Guards Problem
    Proc. 7th Annu. ACM Sympos. Comput. Geom., 1991, pp. 166-175.
  • Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann
    Binary Search Trees of Almost Optimal Height
    Acta Inform. 28, pp. 165-178, 1990.
  • Christian Icking
    Kürzeste Bewegung von Liniensegmenten
    Abstracts 5th Intern. Workshop Comput. Geom., Freiburg, Universität Freiburg, 1989.
  • Christian Icking, Rolf Klein, Thomas Ottmann
    Priority Search Trees in Secondary Memory
    Proc. 13th Internat. Workshop Graph-Theoret. Concepts Comput. Sci.,
    Lecture Notes Comput. Sci. 314, Springer-Verlag, 1988, pp. 84-93.
  • Christian Icking
    Le Balayage Appliqué aux Opérations Ensemblistes et au Régionnement
    Diploma Thesis (DEA), Department of Computer Science, Université Pierre et Marie Curie Paris VI, Paris, France, 1985.
  • Christian Icking
    Calcul et Visualisation du Contour de l'Intersection d'un Tronc de Cône avec un Plan
    Mémoire de Ma\^\itrise (Master's thesis), Ecole Nationale de Techniques Avançées, Paris, France, 1984.
  • Philippus Kiestra, Christian Icking
    Milchmengenmeßgerät und Verfahren zum Messen der von einer Kuh im Zuge des Melkens abgegebenen Gesamtmilchmenge
    Patentinhaber Westfalia Separator AG, Oelde. Europäische Patentschrift EP 0 041 120 B1, Europäisches Patentamt, München, 1984.
  • Philippus Kiestra, Christian Icking
    Milchmengenmeßgerät für Melkanlagen zum unmittelbaren Messen der von einer Kuh im Zuge des Melkens abgegebenen Milchmenge
    Patentinhaber Westfalia Separator AG, Oelde. Patentschrift DE 30 20 161 C2, Deutsches Patentamt, München, 1982.

Publikationen

Technische Berichte

begutachtete Konferenzbandbeiträge

  • Christian Icking; Thomas Kamphans; Rolf Klein; Elmar Langetepe: Exploring Simple Grid Polygons, in 11th International Computing and Combinatorics Conference, Kunming, China, Lecture Notes Comput. Sci. 3595, Springer-Verlag, 2005, pp. 524-533.
04.09.2015
FernUni-Logo FernUniversität in Hagen, Lehrgebiet Kooperative Systeme, 58084 Hagen