Your search returned the following 16 documents:

16. Checking geometric programs or verification of geometric structures
    Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, and Christian Uhrig
    Computational Geometry: Theory and Applications 12 (1-2): 85-104, 1999
    
    
15. A computational basis for higher-dimensional computational geometry and applications
    Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, and Joachim Ziegler
    Computational Geometry: Theory and Applications 10 (4): 289-304, 1998
    
14. A Computational Basis for Higher-dimensional Computational Geometry and Applications
    Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, and Joachim Ziegler
    In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), Nice, France, June, 4 - June, 6, 1997, 254-263
    
13. Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
    Kurt Mehlhorn, R. Sundar, and Christian Uhrig
    Algorithmica 17 (2): 183-198, 1997
    
12. The LEDA platform for combinatorial and geometric computing
    Kurt Mehlhorn, Stefan Näher, and Christian Uhrig
    In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), Bologna, Italy, July 7-11, 1997, 7-16
    
11. Checking Geometric Programs or Verification of Geometric Structures
    Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, and Christian Uhrig
    In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), Philadelphia, PA, USA, May, 24-26, 1996, 159-165
    
10. The LEDA Platform for Combinatorial and Geometric Computing
    Kurt Mehlhorn, Stefan Näher, and Christian Uhrig
    In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, Klagenfurt; Österreich, 1996, 43-50
    
9. Exact Geometric Computation in LEDA
   Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
   In: 11th ACM Symposium on Computational Geometry (SCG95), Vancouver, British Columbia, Canada, June, 5th - 7th, 1995, C18-C19
   
   
8. Lower bounds for set intersection queries
   Paul Dietz, Kurt Mehlhorn, Rajeev Raman, and Christian Uhrig
   Algorithmica 14 (2): 154-168, 1995
   
   
7. Maintaining dynamic sequences under equality-tests in polylogarithmic time
   Kurt Mehlhorn, R. Sundar, and Christian Uhrig
   In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, Arlington, USA, 1994, 213-222
   
6. Lower Bounds for Set Intersection queries
   Paul Dietz, Kurt Mehlhorn, Rajeev Raman, and Christian Uhrig
   In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, Austin, USA, 1993, 194-201
   
5. Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
   Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
   Algorithmica 8 (5/6): 391-408, 1992. Note: Conference version in Proceedings of 6th ACM Symposium on Computational Geometry, 1990
   
4. Selected Topics from Computational Geometry, Data Structures and Motion Planning
   Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios Tsakalidis, and Christian Uhrig
   In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 1992, 25-43
   
3. Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
   Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
   In: Computational geometry (SCG-90) : 6th annual symposium, Berkeley, USA, 1990, 281-289
   
2. Hidden line elimination for isooriented rectangles
   Kurt Mehlhorn, Stefan Näher, and Christian Uhrig
   Information Processing Letters 35 (3): 137-143, 1990
   [PDF: Download: HiddenLineRectangles.pdf]
   
1. Hidden line elimination for isooriented rectangles
   Kurt Mehlhorn, Stefan Näher, and Christian Uhrig
   Universität des Saarlandes, Saarbrücken, A 90/02
   [PDF: Download: Mehlhorn_SFB_A_02_90-1.pdf]