Mingjun Zhang
ABSTRACT
An improved parametric line clipping algorithm is presented. The line clipping algorithm is extended to polygon clipping. The implementations of both the algorithms are novel and outperform many previous algorithms in the literature. This is supported by theoretical consideration and experimental results on randomly selected lines and polygons. The algorithms are implemented in Java. The Java applet allows the user to visualize the experimental results by comparing the existing algorithms and the new algorithms.
- Bui, Duc Huy, and Vaclav Skala, Fast algorithms for clipping lines and line segments in E2, The Visual Computer, Vol. 14, pp.31-37, 1998.Google Scholar
Cross Ref
- Cyrus, M. and J. Buck, Generalized two- and three dimensional Clipping, Computers and Graphics, 3(1), 1978, pp.23-28.Google ScholarCross Ref
- Foley, James D., and Andries Van Dam, Fundamentals of Interactive Graphics, Addison-Wesley Publishing Company, 1982. Google ScholarDigital Library
- Haohong, Wang; Wu Ruixun, CAI Shijie Journal of Computer Science and Technology v.13 #5 Sept 1998, p.410-416.Google Scholar
- Liang Y. D. and Brian A. Barsky, "Analysis and Algorithm for Polygon Clipping", Communications of ACM, Vol. 26, p.868-877, 1983 Google ScholarDigital Library
- Liang, Y-D., and B. Barsky, A new concept and method for Line Clipping, ACM, TOG,3(1), 1984, pp.1-22. Google ScholarDigital Library
- Maillot Patick-Gilles, "A New, Fast method for 2D polygon Clipping: Analysis and Software Implementation", ACM Transactions on Graphics, vol. 11, p.276-290, 19992. Google ScholarDigital Library
- Sobkow, Mark.; Paul S Pospisil, Yee-Hong Yang, A Fast Two Dimensional Line Clipping Algorithm Via Line Encoding, Computer Graphics, v.11#4 1987, p.459-467.Google Scholar
- Sutherland, Ivan E. and Gary W. Hodgeman, "Reentrant Polygon Clipping, Communications of ACM, vol. 17, p.32-42, 1974. Google ScholarDigital Library
- Nichol-Lee-Nichol, 2D Line Clipping, Procedural Elements for Computer Graphics by David F. Rogers.Google Scholar
Index Terms
- An efficient implementation of parametric line and polygon clipping algorithm
Recommendations
A new, fast method for 2D polygon clipping: analysis and software implementation
This paper presents a new 2D polygon clipping method, based on an extension to the Sutherland-Cohen 2D line clipping method. After discussing three basic polygon clipping algorithms, a different approach is proposed, explaining the principles of a new ...
Industrial strength polygon clipping: A novel algorithm with applications in VLSI CAD
We present an algorithm to compute the topology and geometry of an arbitrary number of polygon sets in the plane, also known as the map overlay. This algorithm can perform polygon clipping and related operations of interest in VLSI CAD. The algorithm ...
Comments