{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:03:32Z","timestamp":1760148212579,"version":"build-2065373602"},"reference-count":14,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T00:00:00Z","timestamp":1680998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Clipping algorithms essentially compute the intersection of the clipping object and the subject, so to go from two to three dimensions we replace the two-dimensional clipping object by the three-dimensional one (the view frustum). In three-dimensional graphics, the terminology of clipping can be used to describe many related features. Typically, \u201cclipping\u201d refers to operations in the plane that work with rectangular shapes, and \u201cculling\u201d refers to more general methods to selectively process scene model elements. The aim of this article is to survey important techniques and algorithms for line clipping in 3D, but it also includes some of the latest research performed by the authors.<\/jats:p>","DOI":"10.3390\/a16040201","type":"journal-article","created":{"date-parts":[[2023,4,10]],"date-time":"2023-04-10T03:19:54Z","timestamp":1681096794000},"page":"201","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Line Clipping in 3D: Overview, Techniques and Algorithms"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6707-6497","authenticated-orcid":false,"given":"Dimitrios","family":"Matthes","sequence":"first","affiliation":[{"name":"Department of Computer Science and Biomedical Informatics, University of Thessaly, 35131 Lamia, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6478-3943","authenticated-orcid":false,"given":"Vasileios","family":"Drakopoulos","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Biomedical Informatics, University of Thessaly, 35131 Lamia, Greece"}]}],"member":"1968","published-online":{"date-parts":[[2023,4,9]]},"reference":[{"key":"ref_1","unstructured":"Hearn, D., Baker, M.P., and Carithers, W.R. (2014). Computer Graphics with Open GL, Pearson Education Limited. [4th ed.]."},{"key":"ref_2","unstructured":"Hughes, J.F., van Dam, A., McGuire, M., Sklar, D.F., Foley, J.D., Feiner, S.K., and Akeley, K. (2013). Computer Graphics Principles and Practice, Addison-Wesley Professional. [3rd ed.]."},{"key":"ref_3","unstructured":"Rogers, D.F. (1997). Procedural Elements for Computer Graphics, McGraw-Hill, Inc.. [2nd ed.]."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5121\/ijcga.2019.9301","article-title":"Another simple but faster method for 2D line clipping","volume":"9","author":"Matthes","year":"2019","journal-title":"Int. J. Comput. Graph. Animat."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/357332.357333","article-title":"A new concept and method for line clipping","volume":"3","author":"Liang","year":"1984","journal-title":"TOG"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0097-8493(78)90021-3","article-title":"Generalized two- and three-dimensional clipping","volume":"3","author":"Cyrus","year":"1978","journal-title":"Comput. Graph."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/37402.37432","article-title":"An efficient new algorithm for 2-D line clipping: Its development and analysis","volume":"21","author":"Nicholl","year":"1987","journal-title":"Comput. Graph."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1007\/s00371-005-0305-3","article-title":"A new approach to line and line segment clipping in homogeneous coordinates","volume":"21","author":"Skala","year":"2005","journal-title":"Vis. Comput."},{"key":"ref_9","unstructured":"Skala, V. (2012\u20131, January 28). S-clip E2: A new concept of clipping algorithms. Proceedings of the SA \u201912: SIGGRAPH Asia, Singapore."},{"key":"ref_10","first-page":"1","article-title":"An efficient algorithm for line clipping in computer graphics programming","volume":"1","author":"Kodituwakku","year":"2013","journal-title":"Ceylon J. Sci. (Physical Sci.)"},{"key":"ref_11","first-page":"380","article-title":"The Line Clipping Algorithm Basing on Affine Transformation","volume":"2","author":"Huang","year":"2010","journal-title":"Intell. Inf. Manag."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0097-8493(93)90050-J","article-title":"Simple and Efficient 2D and 3D Span Clipping Algorithms","volume":"17","author":"Duvanenko","year":"1993","journal-title":"Comput. Graph."},{"key":"ref_13","first-page":"96","article-title":"An efficient line clipping algorithm for 3D space","volume":"2","author":"Kodituwakku","year":"2012","journal-title":"Int. J. Adv. Res. Comput. Sci. Softw. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/BF01889980","article-title":"3D-line Clipping Algorithms\u2014A Comparative Study","volume":"11","author":"Kolingerova","year":"1994","journal-title":"Vis. Comput."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/4\/201\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:12:42Z","timestamp":1760123562000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/4\/201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,9]]},"references-count":14,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,4]]}},"alternative-id":["a16040201"],"URL":"https:\/\/doi.org\/10.3390\/a16040201","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,4,9]]}}}