{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T08:51:04Z","timestamp":1771059064111,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Visual Computer"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1007\/bf01900665","type":"journal-article","created":{"date-parts":[[2005,7,8]],"date-time":"2005-07-08T13:12:57Z","timestamp":1120828377000},"page":"407-422","source":"Crossref","is-referenced-by-count":7,"title":["2D line and polygon clipping based on space subdivision"],"prefix":"10.1007","volume":"10","author":[{"given":"Mel","family":"Slater","sequence":"first","affiliation":[]},{"given":"Brian A.","family":"Barsky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"BF01900665_CR1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1111\/j.1467-8659.1989.tb00484.x","volume":"8","author":"RD Andreev","year":"1989","unstructured":"Andreev RD (1989) Algorithm for clipping arbitrary polygons. Comput Graph Forum 8(3): 183\u201391","journal-title":"Comput Graph Forum"},{"issue":"1","key":"BF01900665_CR2","first-page":"98","volume":"11","author":"JF Blina","year":"1991","unstructured":"Blina JF (1991) A trip down the graphics pipeline-line clipping. IEEE CG&A 11(1): 98\u2013105","journal-title":"IEEE CG&A"},{"issue":"1","key":"BF01900665_CR3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1147\/sj.41.0025","volume":"4","author":"JE Bresenham","year":"1965","unstructured":"Bresenham JE (1965) Algorithm for computer control of digital plotter. IBM Syst J, 4(1): 25\u201330","journal-title":"IBM Syst J"},{"key":"BF01900665_CR4","unstructured":"Cleary JG, Wyvill B, Birtistle GM, Vatti R (1983) Multiprocessor ray tracing, Tech Rep 83\/128\/17, Department of Computer Science, University of Calgary."},{"key":"BF01900665_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01905559","volume":"4","author":"JG Cleary","year":"1988","unstructured":"Cleary JG, Wyvill G (1988) Analysis of algorithm for fast ray tracing using uniform space subdivision. Vis Comput 4:65\u201383","journal-title":"Vis Comput"},{"issue":"1","key":"BF01900665_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0097-8493(78)90021-3","volume":"3","author":"M Cytus","year":"1978","unstructured":"Cytus M, Beck J (1978) Generalised two- and three-dimensional clipping. Comput. and Graph 3(1): 23\u201328","journal-title":"Comput. and Graph"},{"issue":"3","key":"BF01900665_CR7","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/964965.808592","volume":"18","author":"M Dippe","year":"1984","unstructured":"Dippe M, Swensen J (1984) An adaptive subdivision algorithm and parallel architecture for realistic image synthesis. Comput Graph (SIGGRAPH) 18(3): 149\u2013158","journal-title":"Comput Graph (SIGGRAPH)"},{"issue":"7","key":"BF01900665_CR8","first-page":"36","volume":"15","author":"VJ Duvanenko","year":"1990","unstructured":"Duvanenko VJ, Robbins WE, Gyurcsik RS (1990) Improving line segment clipping. Dr Dobb's J Software Tools, 15(7): 36, 38, 40, 42, 44\u20135, 98, 100","journal-title":"Dr Dobb's J Software Tools"},{"issue":"3\/4","key":"BF01900665_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/0097-8493(90)90067-8","volume":"14","author":"M Dorr","year":"1990","unstructured":"Dorr M (1990) A new approach to parametric line clipping. Comput and Graph 14(3\/4): 449\u2013464","journal-title":"Comput and Graph"},{"key":"BF01900665_CR10","volume-title":"Computer graphics: principles and practise","author":"JD Foley","year":"1990","unstructured":"Foley JD, van Dam A, Feiner S, Hughes J (1990) Computer graphics: principles and practise. Addison-Wesley, Reading, MS"},{"issue":"8","key":"BF01900665_CR11","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/0031-3203(90)90133-6","volume":"23","author":"DY Fang","year":"1990","unstructured":"Fang DY, Chu JL (1990) A string pattern recognition approach to polygon clipping. Pattern Recogn 23(8): 879\u2013892","journal-title":"Pattern Recogn"},{"issue":"4","key":"BF01900665_CR12","first-page":"16","volume":"6","author":"A Fujimoto","year":"1986","unstructured":"Fujimoto A, Tanaka T, Iwata K (1986) ARTS: Accelerated Ray-Tracing System. IEEE CG&A 6(4): 16\u201326","journal-title":"IEEE CG&A"},{"key":"BF01900665_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0020-0190(90)90111-A","volume":"35","author":"KY Fung","year":"1990","unstructured":"Fung KY, Nicholl TM, Tarjan RE, van Wyk CJ (1990) Simplified linear-time Jordan sorting and polygon clipping. Inf Process Lett 35: 85\u201392","journal-title":"Inf Process Lett"},{"issue":"1","key":"BF01900665_CR14","first-page":"15","volume":"4","author":"AS Glassner","year":"1984","unstructured":"Glassner AS (1984) Space subdivision for fast ray tracing. IEEE CG&A 4(1): 15\u201322","journal-title":"IEEE CG&A"},{"key":"BF01900665_CR15","unstructured":"Kaplan MR (1985) A constant time ray tracer. SIGGRAPH 85 Tutorial, San Francisco"},{"key":"BF01900665_CR16","first-page":"184","volume-title":"Techniques for computer graphics","author":"MR Kaplan","year":"1987","unstructured":"Kaplan MR (1987) The use of spatial coherence in ray tracing. In: Rogers DF, Earnshaw, RA (eds) Techniques for computer graphics. Springer, Berlin Heidelberg New York, pp 184\u2013193"},{"key":"BF01900665_CR17","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1145\/182.358439","volume":"26","author":"Y-D Liang","year":"1983","unstructured":"Liang Y-D, Barsky BA (1983) An analysis and algorithm for polygon clipping. Commun ACM 26: 868\u2013877","journal-title":"Commun ACM"},{"issue":"1","key":"BF01900665_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/357332.357333","volume":"3","author":"Y-D Liang","year":"1984","unstructured":"Liang Y-D, Barsky BA (1984) A new concept and method for line clipping. ACM Trans Graph 3(1): 1\u201322","journal-title":"ACM Trans Graph"},{"key":"BF01900665_CR19","volume-title":"Algorithms and parallel VLSI architectures Conference","author":"Y-D Liang","year":"1990","unstructured":"Liang Y-D, Barsky BA (1990) An improved parametric line clipping algorithm. In: Deprettere EF (ed) Algorithms and parallel VLSI architectures Conference Elsevier, Amsterdam"},{"key":"BF01900665_CR20","unstructured":"Liang Y-D, Barsky BA, Slater M (1992) Some improvements to a parametric line clipping algorithm. Tech Rep 92\/688, CS Division, Electrical Engineering and Computer Sciences, University of California at Berkeley"},{"key":"BF01900665_CR21","series-title":"Technical Report No. UCB\/CSD 92\/691","volume-title":"The optimal Tree Algorithm for line clipping","author":"Y-D Liang","year":"1992","unstructured":"Liang Y-D, Barsky BA (1992) The optimal Tree Algorithm for line clipping. Technical Report No. UCB\/CSD 92\/691, Computer Science Division, Electrical Engineering and Computer Sciences Dept, University of California, Berkeley, California, USA"},{"key":"BF01900665_CR22","volume-title":"Principles of interactive computer graphics","author":"WM Newman","year":"1979","unstructured":"Newman WM, Sproull RF (1979) Principles of interactive computer graphics, 2nd edn. McGraw-Hill, New York","edition":"2nd edn"},{"issue":"4","key":"BF01900665_CR23","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/37402.37432","volume":"21","author":"TM Nicholl","year":"1987","unstructured":"Nicholl TM, Lee DT, Nicholl RA (1987) An efficient new algorithm for 2-D line clipping: its development and analysis. Comput Graph (SIGGRAPH) 21(4): 253\u2013262","journal-title":"Comput Graph (SIGGRAPH)"},{"issue":"1","key":"BF01900665_CR24","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/77635.77637","volume":"9","author":"RA Nicholl","year":"1990","unstructured":"Nicholl RA, Nicholl TN (1990) Performing geometric transformations by program transformation. ACM Trans Graph 9(1): 28\u201340","journal-title":"ACM Trans Graph"},{"issue":"1","key":"BF01900665_CR25","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01994114","volume":"7","author":"A Rappoport","year":"1991","unstructured":"Rappoport A (1991) An efficient algorithm for line and polygon clipping. Vis Comput 7(1): 19\u201328","journal-title":"Vis Comput"},{"issue":"2","key":"BF01900665_CR26","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0097-8493(90)90041-U","volume":"14","author":"KK Shi","year":"1990","unstructured":"Shi KK, Edwards JA, Cooper DC (1990) An efficient line clipping algorithm. Comput and Graph 14(2): 297\u2013301","journal-title":"Comput and Graph"},{"key":"BF01900665_CR27","first-page":"355","volume-title":"Eurographics 89, proceedings","author":"V Skala","year":"1989","unstructured":"Skala V (1989) Algorithms for 2D line clipping. In: Hansmann W, Hopgood FRA, Strasser W (eds) Eurographics 89, proceedings. North-Holland, Amsterdam, pp 355\u201366"},{"key":"BF01900665_CR28","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01901027","volume":"9","author":"M Slater","year":"1992","unstructured":"Slater M (1992) Tracing a ray through uniformly subdivided n-dimensional space. Vis Computer 9:39\u201346","journal-title":"Vis Computer"},{"issue":"4","key":"BF01900665_CR29","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/0097-8493(87)90061-6","volume":"11","author":"MS Sobkow","year":"1987","unstructured":"Sobkow MS, Pospilsil P, Yang Y-H (1987) A fast two-dimensional line clipping algorithm via line encoding. Comput and Graph 11(4): 459\u2013467","journal-title":"Comput and Graph"},{"key":"BF01900665_CR30","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/360767.360802","volume":"17","author":"IE Sutherland","year":"1974","unstructured":"Sutherland IE, Hodgman GW (1974) Reentrant polygon clipping. Commun ACM 17: 32\u201342","journal-title":"Commun ACM"},{"key":"BF01900665_CR31","first-page":"75","volume":"April","author":"RB Tilove","year":"1981","unstructured":"Tilove RB (1981) Line\/polygon classification: a study of the complexity of geometrical classification. IEEE CCG&A April: 75\u201386","journal-title":"IEEE CCG&A"},{"key":"BF01900665_CR32","volume-title":"Parallel machines for computer graphics","author":"M Ullner","year":"1983","unstructured":"Ullner M (1983) Parallel machines for computer graphics. Ph.D. Thesis California Institute of Technology, Pasadena, California"},{"issue":"4","key":"BF01900665_CR33","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/965105.807462","volume":"14","author":"K Weiler","year":"1980","unstructured":"Weiler K (1980) Polygon comparison using a graph representation. Comput Graph (SIGGRAPH) 14(4): 10\u201318","journal-title":"Comput Graph (SIGGRAPH)"},{"issue":"2","key":"BF01900665_CR34","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/965141.563896","volume":"11","author":"K Weiler","year":"1977","unstructured":"Weiler K, Atherton P (1977) Hidden surface removal using polygon area sorting. Comput Graph (SIGGRAPH) 11(2): 214\u2013222","journal-title":"Comput Graph (SIGGRAPH)"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01900665.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01900665\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01900665","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T16:07:20Z","timestamp":1557504440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01900665"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":34,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["BF01900665"],"URL":"https:\/\/doi.org\/10.1007\/bf01900665","relation":{},"ISSN":["0178-2789","1432-8726"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-8726","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}