Your search returned the following 8 documents:

8. Counting Triangulations Approximately
   Victor Alvarez, Karl Bringmann, Saurabh Ray, and Raimund Seidel
   In: 25th Canadian Conference on Computational Geometry (CCCG-13), Waterloo, Ontario, Canada, 2013, 85-89
   
7. On Computing the Centroid of the Vertices of an Arrangement and Related Problems
   Deepak Ajwani, Saurabh Ray, Raimund Seidel, and Hans Raj Tiwary
   In: 10th Workshop on Algorithms and Data Structures (WADS), Halifax, Canada, 2007, 519-528
   
6. Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
   Khaled M. Elbassioni, Zvi Lotker, and Raimund Seidel
   Information Processing Letters 100 (2): 69 - 71, 2006
   
5. On the Exact Computation of the Topology of Real Algebraic Curves
   Raimund Seidel and Nicola Wolpert
   In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, 2005, 107-115
   
4. 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
   
   
3. 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
   
2. Four Results on Randomized Incremental Constructions
   Kenneth L. Clarkson, Kurt Mehlhorn, and Raimund Seidel
   In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, Cachan, France, 1992, 463-474
   
1. Four Results on Randomized Incremental Constructions
   Kenneth L. Clarkson, Kurt Mehlhorn, and Raimund Seidel
   Computational Geometry: Theory and Applications 3 (4): 185-212, 1993