Advertisement

Topological Sweep in Degenerate Cases

  • Eynat Rafalin
  • Diane Souvaine
  • Ileana Streinu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2409)

Abstract

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 O(n 2) and O(n) time and space complexities of the original algorithm, and is robust and easy to implement. We present experimental results.

Keywords

Intersection Point Computational Geometry Degenerate Case Matching Sequence Elementary Step 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Te. Asano, Leonidas J. Guibas, and T. Tokuyama. Walking on an arrangement topologically. Internat. J. Comput. Geom. Appl., 4:123–151, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    Christoph Burnikel, Kurt Mehlhorn, and Stefan Schirra. On degeneracy in geometric computations. In Daniel D. Sleator, editor, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 16–23, Arlington, VA, January 1994. ACM Press.Google Scholar
  3. [3]
    Mark de Berg, Mark van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry Algorithms and Applications. Springer-Verlag, Berlin Heidelberg, 1997.zbMATHGoogle Scholar
  4. [4]
    H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.zbMATHGoogle Scholar
  5. [5]
    H. Edelsbrunner and Leonidas J. Guibas. Topologically sweeping an arrangement. J. Comput. Syst. Sci., 38:165–194, 1989. Corrigendum in 42 (1991), 249–251.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    H. Edelsbrunner and D. L. Souvaine. Computing median-of-squares regression lines and guided topological sweep. J. Amer. Statist. Assoc., 85:115–119, 1990.zbMATHCrossRefGoogle Scholar
  7. [7]
    J. Gil, W. Steiger, and A. Wigderson. Geometric medians. Discrete Mathematics, 108:37–51, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    F. Gomez, S. Ramaswami, and G. Toussaint. On removing non-degeneracy assumptions in computational geometry. In Algorithms and Complexity (Proc. CIAC’ 97), volume 1203 of Lecture Notes Comput. Sci., pages 86–99. Springer-Verlag, 1997.Google Scholar
  9. [9]
    K. Miller, S. Ramaswami, P. Rousseeuw, T. Sellares, D. Souvaine, I. Streinu, and A. Struyf. Fast implementation of depth contours using topological sweep. In Proceedings of the Twelfth ACM-SIAM Symposium on Discrete Algorithms, pages 690–699, Washington, DC, January 2001.Google Scholar
  10. [10]
    M. Pocchiola and G. Vegter. Topologically sweeping visibility complexes via pseudo-triangulations. Discrete Comput. Geom., 16:419–453, December 1996.Google Scholar
  11. [11]
    H. Rosenberger. Order k Voronoi diagrams of sites with additive weights in the plane. M.Sc. thesis, Dept. Comput. Sci., Univ. Illinois, Urbana, IL, 1988. Report UIUCDCS-R-88-1431.Google Scholar
  12. [12]
    Emo Welzl. Constructing the visibility graph for n line segments in O(n 2) time. Inform. Process. Lett., 20:167–171, 1985.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Eynat Rafalin
    • 1
  • Diane Souvaine
    • 1
  • Ileana Streinu
    • 2
  1. 1.Department of Electrical Engineering and Computer ScienceTufts UniversityMedford
  2. 2.Department of Computer ScienceSmith CollegeNorthampton

Personalised recommendations