Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Topological sweep can contribute to efficient implementations of various algorithms for data analysis. Real data, however, has degeneracies. The modification of the topological sweep algorithm presented here handles degenerate cases such as parallel or multiply concurrent lines without requiring numerical perturbations to achieve general position. Our method maintains the 0(n2) and 0(n) time and space complexities of the original algorithm, and is robust and easy to implement. We present experimental results.
Rafalin, Eynat; Souvaine, Diane; and Streinu, Ileana, "Topological Sweep in Degenerate Cases" (2002). Computer Science: Faculty Publications, Smith College, Northampton, MA.
Archived as published.