{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:32:01Z","timestamp":1736400721898,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340706"},{"type":"electronic","value":"9783540340713"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11751540_15","type":"book-chapter","created":{"date-parts":[[2006,5,10]],"date-time":"2006-05-10T12:28:51Z","timestamp":1147264131000},"page":"131-140","source":"Crossref","is-referenced-by-count":2,"title":["A Speculative Approach to Clipping Line Segments"],"prefix":"10.1007","author":[{"given":"Frank","family":"D\u00e9vai","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/38.67707","volume":"11","author":"J.F. Blinn","year":"1991","unstructured":"Blinn, J.F.: A trip down the graphics pipeline: Line clipping. IEEE Computer Graphics & Applications\u00a011(1), 98\u2013105 (1991)","journal-title":"IEEE Computer Graphics & Applications"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0097-8493(78)90021-3","volume":"3","author":"M. Cyrus","year":"1978","unstructured":"Cyrus, M., Beck, J.: Generalised two- and three-dimensional clipping. Computers & Graphics\u00a03(1), 23\u201338 (1978)","journal-title":"Computers & Graphics"},{"issue":"4","key":"15_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1111\/1467-8659.1140241","volume":"11","author":"J.D. Day","year":"1992","unstructured":"Day, J.D.: A new two dimensional line clipping algorithm for small windows. Computer Graphics Forum\u00a011(4), 241\u2013245 (1992)","journal-title":"Computer Graphics Forum"},{"doi-asserted-by":"crossref","unstructured":"D\u00e9vai, F.: An analysis technique and an algorithm for line clipping. In: Proc. 1998 IEEE Conference on Information Visualization, IV 1998, pp. 157\u2013165 (1998)","key":"15_CR4","DOI":"10.1109\/IV.1998.694214"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/11424758_75","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2005","author":"F. D\u00e9vai","year":"2005","unstructured":"D\u00e9vai, F.: Analysis of the Nicholl-Lee-Nicholl algorithm. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Lagan\u00e1, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol.\u00a03480, pp. 726\u2013736. Springer, Heidelberg (2005)"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0097-8493(93)90050-J","volume":"17","author":"V.J. Duvanenko","year":"1993","unstructured":"Duvanenko, V.J., Gyurcsik, R.S., Robins, W.E.: Simple and efficient 2D and 3D span clipping algorithms. Computers & Graphics\u00a017(1), 39\u201354 (1993)","journal-title":"Computers & Graphics"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/357332.357333","volume":"3","author":"Y.D. Liang","year":"1984","unstructured":"Liang, Y.D., Barsky, B.A.: A new concept and method for line clipping. ACM Transactions on Graphics\u00a03(1), 1\u201322 (1984)","journal-title":"ACM Transactions on Graphics"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/37402.37432","volume":"21","author":"T.M. Nicholl","year":"1987","unstructured":"Nicholl, T.M., Lee, D.T., Nicholl, R.A.: An efficient new algorithm for 2-D line clipping: its development and analysis. Comput. Graph.\u00a021(4), 253\u2013262 (1987)","journal-title":"Comput. Graph."},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF01900665","volume":"10","author":"M. Slater","year":"1994","unstructured":"Slater, M., Barsky, B.A.: 2D line and polygon clipping based on space subdivision. The Visual Computer\u00a010(1), 407\u2013422 (1994)","journal-title":"The Visual Computer"},{"key":"15_CR10","volume-title":"Computer Graphics: Principles and Practice","author":"J.D. Foley","year":"1996","unstructured":"Foley, J.D., van Dam, A., Feiner, S.K., Hughes, J.F.: Computer Graphics: Principles and Practice, 2nd edn. Addison-Wesley, Reading (1996)","edition":"2"},{"key":"15_CR11","volume-title":"Computer Graphics with OpenGL","author":"D. Hearn","year":"2004","unstructured":"Hearn, D., Baker, P.: Computer Graphics with OpenGL, 3rd edn. Prentice Hall, Englewood Cliffs (2004)","edition":"3"},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/0097-8493(93)90030-D","volume":"17","author":"V. Skala","year":"1993","unstructured":"Skala, V.: An efficient algorithm for line clipping by convex polygon. Computers & Graphics\u00a017(4), 417\u2013421 (1993)","journal-title":"Computers & Graphics"},{"key":"15_CR13","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: Sorting and Searching. In: The Art of Computer Programming, vol.\u00a03. Addison-Wesley, Reading (1973)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"On the difficulty of finding reliable witnesses","author":"W.R. Alford","year":"1995","unstructured":"Alford, W.R., Granville, A., Pomerance, C.: On the difficulty of finding reliable witnesses. LNCS, vol.\u00a0877, pp. 1\u201316. Springer, Heidelberg (1995)"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M.O. Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic algorithms for testing primality. Journal of Number Theory\u00a012, 128\u2013138 (1980)","journal-title":"Journal of Number Theory"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751540_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T22:21:22Z","timestamp":1736374882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751540_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340706","9783540340713"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11751540_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}