You-Dong Liang
Supplemental Material
Available for Download
A corrigendum for this article was issued by the authors for this article in Communications of the ACM volume 27, issue 2
- 1 Liang You-Dong and Barsky, Brian A. A new concept and method for line clipping. ACM Transactions on Graphics, to appear. Google Scholar
Digital Library
- 2 Liang You-Dong and Barsky, Brian A. Three new algorithms for twodimensional line clipping. (In preparation.)Google Scholar
- 3 Sutherland Ivan E. and Hodgman, Gary W. Reentrant polygon clipping. Comm. ACM. 17, 1 (Jan. 1974) 32-42. Google ScholarDigital Library
- 4 Tilove, Robert B. Set membership classification: A unified approach to geometric intersection problems. IEEE Trans. Computers C.29, 10 (Oct. 1980) 874-883.Google Scholar
- 5 Weiler, Kevin J. Hidden Surface Removal Using Polygon Area Sorting. Master's Thesis, Cornell University, Ithaca, N.Y. (Jan. 1978).Google Scholar
- 6 Weiler, Kevin J. Polygon comparison using a graph representation. Proc. SIGGRAPH '89, ACM, (July, 1980), pp. 10-18. Also Research Report No. 6, Institute of Building Sciences, Carnegie-Mellon University, Pittsburgh, Pennsylvania, May 1980. Google ScholarDigital Library
Index Terms
- An analysis and algorithm for polygon 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 ...
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 ...
Polygon comparison using a graph representation
SIGGRAPH '80: Proceedings of the 7th annual conference on Computer graphics and interactive techniquesAll of the information necessary to perform the polygon set operations (union, intersection, and difference) and therefore polygon clipping can be generated by a single application of a process called polygon comparison. This process accepts two or more ...
Comments