Topological sweep in degenerate cases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2409, Issue , 2002, Pages 155-165

  Rafalin, Eynat ^a   Souvaine, Diane ^a   Streinu, Ileana ^b  

^a TUFTS UNIVERSITY   (United States)

^b SMITH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; NUMERICAL METHODS; TOPOLOGY;

DEGENERATE CASE; EFFICIENT IMPLEMENTATION; ORIGINAL ALGORITHMS; TIME AND SPACE COMPLEXITY; TOPOLOGICAL SWEEP;

TOPOLOGY; ALGORITHMS;

EID: 23044532393     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45643-0_12     Document Type: Conference Paper

References (12)

1. [1] Te. Asano, Leonidas J. Guibas, and T. Tokuyama. Walking on an arrangement topologically. Interned. J. Comput. Geom. Appl., 4:123-151, 1994.
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-SIAMSymposium on Discrete Algorithms, pages 16-23, Arlington, VA, January 1994. ACM Press.
3. [3] Mark de Berg, Mark van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry Algorithms and Applications. Springer-Verlag, Berlin Heidelberg, 1997.
4. [4] H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.
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.
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.
7. [7] J. Gil, W. Steiger, and A. Wigderson. Geometric medians. Discrete Mathematics, 108:37-51, 1992.
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.
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.
10. [10] M. Pocchiola and G. Vegter. Topologically sweeping visibility complexes via pseudo-triangulations. Discrete Comput. Geom., 16:419-453, December 1996.
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.
12. Emo Welzl. Constructing the visibility graph for n line segments in 0(n2) time. Inform. Process. Lett, 20:167-171, 1985.