{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T14:05:10Z","timestamp":1743429910938},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439776"},{"type":"electronic","value":"9783540456438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45643-0_12","type":"book-chapter","created":{"date-parts":[[2007,9,24]],"date-time":"2007-09-24T20:58:33Z","timestamp":1190667513000},"page":"155-165","source":"Crossref","is-referenced-by-count":10,"title":["Topological Sweep in Degenerate Cases"],"prefix":"10.1007","author":[{"given":"Eynat","family":"Rafalin","sequence":"first","affiliation":[]},{"given":"Diane","family":"Souvaine","sequence":"additional","affiliation":[]},{"given":"Ileana","family":"Streinu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,12]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1142\/S0218195994000094","volume":"4","author":"Te. Asano","year":"1994","unstructured":"Te. Asano, Leonidas J. Guibas, and T. Tokuyama. Walking on an arrangement topologically. Internat. J. Comput. Geom. Appl., 4:123\u2013151, 1994.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"12_CR2","unstructured":"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\u201323, Arlington, VA, January 1994. ACM Press."},{"key":"12_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry Algorithms and Applications","author":"M. Berg de","year":"1997","unstructured":"Mark de Berg, Mark van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry Algorithms and Applications. Springer-Verlag, Berlin Heidelberg, 1997."},{"key":"12_CR4","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","volume":"38","author":"H. Edelsbrunner","year":"1989","unstructured":"H. Edelsbrunner and Leonidas J. Guibas. Topologically sweeping an arrangement. J. Comput. Syst. Sci., 38:165\u2013194, 1989. Corrigendum in 42 (1991), 249\u2013251.","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.2307\/2289532","volume":"85","author":"H. Edelsbrunner","year":"1990","unstructured":"H. Edelsbrunner and D. L. Souvaine. Computing median-of-squares regression lines and guided topological sweep. J. Amer. Statist. Assoc., 85:115\u2013119, 1990.","journal-title":"J. Amer. Statist. Assoc."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(92)90658-3","volume":"108","author":"J. Gil","year":"1992","unstructured":"J. Gil, W. Steiger, and A. Wigderson. Geometric medians. Discrete Mathematics, 108:37\u201351, 1992.","journal-title":"Discrete Mathematics"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"F. Gomez, S. Ramaswami, and G. Toussaint. On removing non-degeneracy assumptions in computational geometry. In Algorithms and Complexity (Proc. CIAC\u2019 97), volume 1203 of Lecture Notes Comput. Sci., pages 86\u201399. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62592-5_63"},{"key":"12_CR9","unstructured":"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\u2013699, Washington, DC, January 2001."},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF02712876","volume":"16","author":"M. Pocchiola","year":"1996","unstructured":"M. Pocchiola and G. Vegter. Topologically sweeping visibility complexes via pseudo-triangulations. Discrete Comput. Geom., 16:419\u2013453, December 1996.","journal-title":"Discrete Comput. Geom."},{"key":"12_CR11","series-title":"Report UIUCDCS-R-88-1431","volume-title":"M.Sc. thesis","author":"H. Rosenberger","year":"1988","unstructured":"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."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","volume":"20","author":"E. Welzl","year":"1985","unstructured":"Emo Welzl. Constructing the visibility graph for n line segments in O(n 2) time. Inform. Process. Lett., 20:167\u2013171, 1985.","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experiments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45643-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T15:09:10Z","timestamp":1587913750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45643-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439776","9783540456438"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45643-0_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}