MPI-INF D1 Publications

Search the publication database

Your search returned the following 5 documents:

  1. Fast Triangulation of the Plane with Respect to Simple Polygons
    Stefan Hertel and Kurt Mehlhorn
    Information and Control 64 (1--3): 52-76, 1985
    [PDF: Download: FastTriangulation.pdf]
  2. Space sweep solves intersection of two convex polyhedra elegantly
    Stefan Hertel, Kurt Mehlhorn, Martti Mäntylä, and Jurg Nievergelt
    Universität des Saarlandes / Fachbereich Angewandte Mathematik und Informatik, Saarbrücken, A 84/02
    [PDF: Download: Mehlhorn_SFB_A_84_02.pdf]
  3. Space Sweep Solves Intersection of Convex Polyhedra
    Stefan Hertel, Martti Mäntylä, Kurt Mehlhorn, and Jurg Nievergelt
    Acta Informatica 21 (5): 501-519, 1984
    [PDF: Download: Mehlhorn_a_1984_p.pdf]
  4. A Probabilistic Algorithm for Vertex Connectivity of Graphs
    Michael Becker, W. Degenhardt, J. Doenhardt, S. Hertel, G. Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, H. Rohnert, and T. Winter
    Information Processing Letters 15 (3): 135-136, 1982
    [PDF: Download: mehlhorn34.pdf]
  5. Fast Triangulation of Simple Polygons
    Stefan Hertel and Kurt Mehlhorn
    In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), Borgholm, Sweden, 1983, 207-218