{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:29Z","timestamp":1725484289761},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439967"},{"type":"electronic","value":"9783540456551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45655-4_49","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T11:37:01Z","timestamp":1179747421000},"page":"456-466","source":"Crossref","is-referenced-by-count":0,"title":["An Experimental Study and Comparison of Topological Peeling and Topological Walk"],"prefix":"10.1007","author":[{"given":"Danny Z.","family":"Chen","sequence":"first","affiliation":[]},{"given":"Shuang","family":"Luan","sequence":"additional","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"49_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/3-540-52921-7_80","volume-title":"Topological sweeping in three dimensions","author":"E.G. Anagnostou","year":"1990","unstructured":"E.G. Anagnostou, L.J. Guibas, and V.G. Polimenis, \u201cTopological sweeping in three dimensions,\u201d Lecture Notes in Computer Science, Vol. 450, Proc. Int\u2019l Symp. on Algorithms, Springer-Verlag, 1990, pp. 310\u2013317."},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/PL00009204","volume":"21","author":"E.M. Arkin","year":"1998","unstructured":"E.M. Arkin, Y.-J. Chiang, M. Held, J.S.B. Mitchell, V. Sacristan, S.S. Skiena, and T.-C. Yang, \u201cOn minimum-area hulls,\u201d Algorithmica, Vol. 21, 1998, pp. 119\u2013136.","journal-title":"Algorithmica"},{"issue":"2","key":"49_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1142\/S0218195994000094","volume":"4","author":"T. Asano","year":"1994","unstructured":"T. Asano, L.J. Guibas, and T. Tokuyama, \u201cWalking in an arrangement topologi-cally,\u201d International Journal of Computational Geometry and Applications, Vol. 4, No. 2, 1994, pp. 123\u2013151.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"49_CR4","unstructured":"T. Asano and T. Tokuyama, \u201cTopological walk revisited,\u201d Proc. 6th Canadian Conf. on Computational Geometry, 1994, pp. 1\u20136."},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"P. Bose, W. Evans, D. Kirkpatrick, M. McAllister, and J. Snoeyink, \u201cApproximating shortest paths in arrangements of lines,\u201d Proc. 8th Canadian Conf. on Computational Geometry, 1996, pp. 143\u2013148.","DOI":"10.1515\/9780773591134-027"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01934990","volume":"25","author":"B. Chazelle","year":"1985","unstructured":"B. Chazelle, L.J. Guibas, and D.T. Lee, \u201cThe power of geometric duality,\u201d BIT, Vol. 25, 1985, pp. 76\u201390.","journal-title":"BIT"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"D.Z. Chen, O. Daescu, X.S. Hu, X. Wu, and J. Xu, \u201cDetermining an optimal penetration among weighted regions in two and three dimensions,\u201d Proc. 15th Annual ACM Symp. on Computational Geometry, 1999, pp. 322\u2013331.","DOI":"10.1145\/304893.304986"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"D.Z. Chen, O. Daescu, X.S. Hu, and J. Xu, \u201cFinding an optimal path without growing the tree,\u201d Proc. 6th Annual European Symp. on Algorithms, 1998, pp. 356\u2013367.","DOI":"10.1007\/3-540-68530-8_30"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"D.Z. Chen, S. Luan, and J. Xu, \u201cTopological peeling and implementation,\u201d 12th Annual Int. Symp. on Algorithms and Computation, 2001, pp. 454\u2013466.","DOI":"10.1007\/3-540-45678-3_39"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"D. Dobkin and A. Tal, \u201cEfficient and Small Representation of Line Arrangements with Applications,\u201d Proc. 17th Annual ACM symposium on Computational Geometry, 2001, pp. 293\u2013301.","DOI":"10.1145\/378583.378707"},{"key":"49_CR11","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, Springer-Verlag, New York, 1987."},{"key":"49_CR12","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 L.J. Guibas, \u201cTopologically sweeping an arrangement,\u201d Journal of Computer and System Sciences, Vol. 38, 1989, pp. 165\u2013194.","journal-title":"Journal of Computer and System Sciences"},{"key":"49_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, J. O\u2019Rourke, and R. Seidel, \u201cConstructing arrangements of lines and hyperplanes with applications,\u201d SIAM J. Computing, Vol. 15, 1986, pp. 341\u2013363.","journal-title":"SIAM J. Computing"},{"key":"49_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.2307\/2289532","volume":"85","author":"H. Edelsbrunner","year":"1990","unstructured":"H. Edelsbrunner and D. Souvaine, \u201cComputing median-of-squares regression lines and guided topological sweep,\u201d Journal of the American Statistical Association, Vol. 85, 1990, pp. 115\u2013119.","journal-title":"Journal of the American Statistical Association"},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1137\/0215019","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner and E. Welzl, \u201cConstructing belts in two-dimensional arrangements with applications,\u201d SIAM J. Computing, Vol. 15, 1986, pp. 271\u2013284.","journal-title":"SIAM J. Computing"},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"D. Eppstein and D. Hart, \u201cAn efficient algorithm for shortest paths in vertical and horizontal segments,\u201d Proc. 5th Int. Workshop on Algorithms and Data Structures, 1997, pp. 234\u2013247.","DOI":"10.1007\/3-540-63307-3_63"},{"key":"49_CR17","unstructured":"D. Eppstein and D. Hart, \u201cShortest paths in an arrangement with k line orientations,\u201d Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, 1999, pp. 310\u2013316."},{"key":"49_CR18","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/S0019-9958(86)80033-X","volume":"68","author":"K. Hoffman","year":"1986","unstructured":"K. Hoffman, K. Mehlhorn, R. Rosenstiehl, and R. Tarjan, \u201cSorting Jordan sequences in linear time using level-linked search trees,\u201d Information and Control, Vol. 68, 1986, pp. 170\u2013184.","journal-title":"Information and Control"},{"key":"49_CR19","doi-asserted-by":"crossref","unstructured":"P.N. Klein, S. Rao, M.H. Rauch, and S. Subramanian, \u201cFaster shortest-path algorithms for planar graphs,\u201d Proc. 26th Annual ACM Symp. Theory of Computing, 1994, pp. 27\u201337.","DOI":"10.1145\/195058.195092"},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"J. Majhi, R. Janardan, M. Smid, and P. Gupta, \u201cOn some geometric optimization problems in layered manufacturing,\u201d Proc. 5th Int. Workshop on Algorithms and Data Structures, 1997, pp. 136\u2013149.","DOI":"10.1007\/3-540-63307-3_54"},{"key":"49_CR21","unstructured":"K. Miller, S. Ramaswami, P. Rousseeuw, T. Sellares, D. Souvaine, I. Streinu, and A. Struyf, \u201cFast implementation of depth contours using topological sweep,\u201d Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, 2001, pp. 690\u2013699."},{"issue":"10","key":"49_CR22","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1145\/358656.358681","volume":"25","author":"J. Nievergelt","year":"1982","unstructured":"J. Nievergelt and F.P. Preparata, \u201cPlane-sweep algorithms for intersecting geometric figures,\u201d Comm. of the ACM, Vol. 25, No. 10, 1982, pp. 739\u2013747.","journal-title":"Comm. of the ACM"},{"key":"49_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45655-4_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T12:29:58Z","timestamp":1707913798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45655-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439967","9783540456551"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45655-4_49","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}