Skip to main content
SpringerLink
Log in

Topological Sweep in Degenerate Cases

  • Conference paper
  • First Online:
Algorithm Engineering and Experiments (ALENEX 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2409))

Included in the following conference series:

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.

Partially supported by NSF grant EIA-99-96237

Partially supported by NSF RUI grant 9731804

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Te. Asano, Leonidas J. Guibas, and T. Tokuyama. Walking on an arrangement topologically. Internat. J. Comput. Geom. Appl., 4:123–151, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  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. Mark de Berg, Mark van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry Algorithms and Applications. Springer-Verlag, Berlin Heidelberg, 1997.

    MATH  Google Scholar 

  4. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.

    MATH  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  Google Scholar 

  7. J. Gil, W. Steiger, and A. Wigderson. Geometric medians. Discrete Mathematics, 108:37–51, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  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. 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. M. Pocchiola and G. Vegter. Topologically sweeping visibility complexes via pseudo-triangulations. Discrete Comput. Geom., 16:419–453, December 1996.

    Google Scholar 

  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. Emo Welzl. Constructing the visibility graph for n line segments in O(n 2) time. Inform. Process. Lett., 20:167–171, 1985.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Tufts University, Medford, MA, 02155

    Eynat Rafalin & Diane Souvaine

  2. Department of Computer Science, Smith College, Northampton, MA, 01063

    Ileana Streinu

Authors
  1. Eynat Rafalin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Diane Souvaine
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ileana Streinu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, MD, 20742, USA

    David M. Mount

  2. Department of IEOR, Columbia University, 500W. 120 St., MC 4704, New York, NY, 10027, USA

    Clifford Stein

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rafalin, E., Souvaine, D., Streinu, I. (2002). Topological Sweep in Degenerate Cases. In: Mount, D.M., Stein, C. (eds) Algorithm Engineering and Experiments. ALENEX 2002. Lecture Notes in Computer Science, vol 2409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45643-0_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45643-0_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43977-6

  • Online ISBN: 978-3-540-45643-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation