A novel and efficient approach for line segment clipping against a convex polygon
Keywords: Computer Graphics Programming, Line Clipping Algorithms, Computational Geometry, Convex Analysis, Time Complexity.
Full Text:Supplementary PDF
Cohen D. 1969. Incremental methods for computer graphics. PhD Thesis, University of Harvard, Massachusetts.
Cyrus M, Beck J. 1978. Generalized two and three dimensional clipping. Computers & Graphics 3(1): 23-28.
Green SL. 1991. Advanced level pure mathematics. North Point, Hong Kong: University Tutorial Press.
Hearn D and Baker MP. 1998. Computer graphics: c version, 2nd Edition. Prentice Hall, Inc. Upper Saddle River. 224-237.
Kodituwakku SR, Wijeweera KR, Chamikara MAP. 2012. An efficient line clipping algorithm for 3D space. International Journal of Advanced Research in Computer Science and Software Engineering 2 (5): 96-101.
Kodituwakku SR, Wijeweera KR, Chamikara MAP. 2013. An efficient algorithm for line clipping in computer graphics programming. Ceylon Journal of Science (Physical Sciences) 17: 1-7.
Liang YD, Barsky BA. 1983. An analysis and algorithms for polygon clipping. CACM 26 (11): 868-876.
Liang YD, Barsky BA. 1984. A new concept and method for line clipping. ACM Transactions on Graphics 3 (1): 1-22.
Preparata PF, Shamos MI 1985. Computational geometry: an introduction. Springer-Verlag, New York.
Rappaport A. 1991. An efficient algorithm for line and polygon clipping. The Visual Computer 7 (1): 19-28.
Skala V. 1993. An efficient algorithm for line clipping by convex polygon. Computers & Graphics 17 (4): 417-421.
Skala V. 1994. O (lg N) line clipping algorithm in E2. Computers & Graphics 18 (4): 517-524.
- There are currently no refbacks.
Ruhuna Journal of Science by University of Ruhuna is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Print ISSN: 1800-279X (Before 2014)