You-Dong Liang
- 1 BLINN, J.F., AND NEWELL, M.E. Clipping using homogeneous coordinates. In SIGGRAPH "78 Conference Proceedings (Atlanta, Ga., Aug. 1978). ACM, New York, 1978, pp. 245-251. Google Scholar
- 2 LIANG, Y.-D., AND BARSKY, B.A. An analysis and algorithm for polygon clipping. Commun. ACM 26, 11 (Nov. 1983), 868-877. Google Scholar
- 3 LIANG, Y.-D., AND BARSKY, B.A. Introducing a new technique for line clipping. In Proceedings of the International Conference on Engineering and Computer Graphics (Beijing, Aug. 27- Sept. 1, 1984), 548-559; also in J. Zhejiang Univ. Special Issue on Computational Geometry (1984), 1-12.Google Scholar
- 4 LIANG Y.-D., AND BARSKY, B.A. Three new algorithms for two-dimensional line clipping. In preparation.Google Scholar
- 5 NEWMAN, W.M., AND SPROULL, R.F. Principles of Interactive Computer Graphics, 2nd ed. McGraw-Hill, New York, 1979. Google Scholar
- 6 SPROULL, R.F., AND SUTHERLAND, I.E. A clipping divider. In Proceedings of the Fall Joint Computer Conference, vol. 33. AFIPS Press, Reston, Va., 1968, pp. 765-776.Google Scholar
Index Terms
- A New Concept and Method for Line Clipping
Recommendations
Reentrant polygon clipping
A new family of clipping algorithms is described. These algorithms are able to clip polygons against irregular convex plane-faced volumes in three dimensions, removing the parts of the polygon which lie outside the volume. In two dimensions the ...
An efficient new algorithm for 2-D line clipping: Its development and analysis
SIGGRAPH '87: Proceedings of the 14th annual conference on Computer graphics and interactive techniquesThis paper describes a new alorithm for clipping a line in two dimensions against a rectangular window. This algorithm avoids computation of intersection points which are not endpoints of the output line segment. The performance of this algorithm is ...
Line clipping algorithm of affine transformation for polygon
ICIC'13: Proceedings of the 9th international conference on Intelligent Computing TheoriesApplying affine transformations to polygon (concave or convex) and line segment, the algorithm of this paper obtains the points of intersection of the polygon and the line segment. Having tested the line segment with a bounding box which includes the ...
Comments