Raimund Seidel

Papers

Total Citations

H-Index

About

Raimund Seidel is a leading figure in computational geometry and algorithm design, whose work has fundamentally shaped how we handle geometric data and computational complexity. His research spans geometric degeneracies, randomized algorithms, and the foundations of data structures, with a particular focus on making geometric computations robust and efficient. Seidel’s most-cited paper, "Efficient Perturbations for Handling Geometric Degeneracies" (1997, 45 citations), introduces a groundbreaking method for dealing with degenerate cases—such as collinear points or coincident lines—that often break geometric algorithms. By applying symbolic perturbations, he provided a clean, practical solution that ensures algorithms remain correct without sacrificing performance, a contribution that has become a standard technique in the field. Beyond this, Seidel is renowned for his work on randomized incremental algorithms, including the celebrated Seidel’s algorithm for linear programming, which achieved expected linear time in fixed dimensions. His insights into the complexity of geometric problems, such as lower bounds for range searching and the analysis of random sampling, have influenced generations of researchers. With a career marked by deep theoretical rigor and practical impact, Seidel’s work continues to be a cornerstone for students and researchers tackling geometric computation.