{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:11:09Z","timestamp":1725495069270},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429852"},{"type":"electronic","value":"9783540456780"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45678-3_39","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T16:12:14Z","timestamp":1195143134000},"page":"454-466","source":"Crossref","is-referenced-by-count":3,"title":["Topological Peeling and Implementation"],"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":[[2001,12,4]]},"reference":[{"key":"39_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 (SIGAL\u201990), Springer-Verlag, 1990, pp. 310\u2013317."},{"key":"39_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":"39_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 topologically,\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":"39_CR4","unstructured":"T. Asano and T. Tokuyama, \u201cTopological walk revisited,\u201d Proc. 6th Canadian Conf. on Computational Geometry (CCCG), 1994, pp. 1\u20136."},{"key":"39_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 CCCG\u201996, pp. 143\u2013148.","DOI":"10.1515\/9780773591134-027"},{"key":"39_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":"39_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,\u201dProc. 15th Annual ACM Symp. on Computational Geometry (SCG), 1999, pp. 322\u2013331.","DOI":"10.1145\/304893.304986"},{"key":"39_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 ESA\u201998, pp. 356\u2013367.","DOI":"10.1007\/3-540-68530-8_30"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987.","DOI":"10.1007\/978-3-642-61568-9"},{"key":"39_CR10","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":"39_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, and 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":"39_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/01621459.1990.10475313","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":"39_CR13","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. on Comp., Vol. 15, 1986, pp. 271\u2013284.","journal-title":"SIAM J. on Comp."},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"D. Eppstein and D. Hart, \u201cAn efficient algorithm for shortest paths in vertical and horizontal segments,\u201d WADS\u201997, pp. 234\u2013247.","DOI":"10.1007\/3-540-63307-3_63"},{"key":"39_CR15","unstructured":"D. Eppstein and D. Hart, \u201cShortest paths in an arrangement with k line orientations,\u201d Proc. 10th ACM-SIAM Symp. on Discrete Algorithms (SODA), 1999, pp. 310\u2013316."},{"key":"39_CR16","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":"39_CR17","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":"39_CR18","doi-asserted-by":"crossref","unstructured":"J. Majhi, R. Janardan, M. Smid, and P. Gupta, \u201cOn some geometric optimization problems in layered manufacturing,\u201d WADS\u201997, pp. 136\u2013149.","DOI":"10.1007\/3-540-63307-3_54"},{"key":"39_CR19","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 SODA, 2001, pp. 690\u2013699."},{"issue":"10","key":"39_CR20","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 fingures,\u201d Comm. of the ACM, Vol. 25, No. 10, 1982, pp. 739\u2013747.","journal-title":"Comm. of the ACM"},{"key":"39_CR21","doi-asserted-by":"crossref","unstructured":"F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.","DOI":"10.1007\/978-1-4612-1098-6"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45678-3_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T03:22:44Z","timestamp":1708312964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45678-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429852","9783540456780"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45678-3_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}