{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:21Z","timestamp":1725549681665},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_14","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"146-157","source":"Crossref","is-referenced-by-count":2,"title":["Line-Segment Intersection Made In-Place"],"prefix":"10.1007","author":[{"given":"Jan","family":"Vahrenhold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/220279.220302","volume-title":"Proceedings of the Eleventh Annual Symposium on Computational Geometry","author":"I.J. Balaban","year":"1995","unstructured":"Balaban, I.J.: An optimal algorithm for finding segments [sic!] intersections. In: Proceedings of the Eleventh Annual Symposium on Computational Geometry, pp. 211\u2013219. ACM Press, New York (1995)"},{"issue":"9","key":"14_CR2","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"-28","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers\u00a0C-28(9), 643\u2013647 (1979)","journal-title":"IEEE Transactions on Computers C"},{"key":"14_CR3","unstructured":"Bose, P., Maheshwari, A., Morin, P., Morrison, J., Smid, M., Vahrenhold, J.: Space-efficient geometric divide-and-conquer algorithms. Computational Geometry: Theory & Applications, 2005. To appear, accepted November 2004. An extend abstract appeared in Proceedings of the 20th European Workshop on Computational Geometry, pp. 65\u201368 (2004)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/997817.997854","volume-title":"Proceedings of the Twentieth Annual Symposium on Computational Geometry","author":"H. Br\u00f6nnimann","year":"2004","unstructured":"Br\u00f6nnimann, H., Chan, T.M.-Y., Chen, E.Y.: Towards in-place geometric algorithms. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 239\u2013246. ACM Press, New York (2004)"},{"issue":"1","key":"14_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.tcs.2003.05.004","volume":"321","author":"H. Br\u00f6nnimann","year":"2004","unstructured":"Br\u00f6nnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., Toussaint, G.T.: Optimal in-place planar convex hull algorithms. Theoretical Computer Science\u00a0321(1), 25\u201340 (2004); An extended abstract appeared in the Proceedings of the Fifth Latin American Symposium on Theoretical Informatics, pp. 494\u2013507 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B.M. Chazelle","year":"1986","unstructured":"Chazelle, B.M., Guibas, L.J.: Fractional cascading: I. A data structuring technique. Algorithmica\u00a01(2), 133\u2013162 (1986)","journal-title":"Algorithmica"},{"key":"14_CR7","unstructured":"Chen, E.Y., Chan, T.M.-Y.: A space-efficient algorithm for line segment intersection. In: Proceedings of the 15th Canadian Conference on Computational Geometry, pp. 68\u201371 (2003)"},{"issue":"12","key":"14_CR8","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"R.W. Floyd","year":"1964","unstructured":"Floyd, R.W.: Algorithm 245: Treesort. Communications of the ACM\u00a07(12), 701 (1964)","journal-title":"Communications of the ACM"},{"issue":"1-2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(98)00162-5","volume":"237","author":"V. Geffert","year":"2000","unstructured":"Geffert, V., Katajainen, J., Pasanen, T.: Asymptotically efficient in-place merging. Theoretical Computer Science\u00a0237(1-2), 159\u2013181 (2000)","journal-title":"Theoretical Computer Science"},{"key":"14_CR10","unstructured":"Handbook of Discrete and Computational Geometry. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Discrete Mathematics and its Applications, 2nd edn., CRC Press, Boca Raton (2004)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BF01994842","volume":"32","author":"J. Katajainen","year":"1992","unstructured":"Katajainen, J., Pasanen, T.: Stable minimum space partitioning in linear time. BIT\u00a032, 580\u2013585 (1992)","journal-title":"BIT"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Mount, D.M.: Geometric intersection. In: Goodman and O\u2019Rourke [10], ch.\u00a038, pp. 857\u2013876","DOI":"10.1201\/9781420035315.ch38"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:51Z","timestamp":1605643791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11534273_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}