Bala R. Vatti
- 1 Cleary G.J., Wyvill B., Birtwistle G.M. and Vatti R. Multiprocessor raytracing. Tech. Rep. 83/128/17, Department of Computer Science, The University of Calgary, Oct. 1983.Google Scholar
- 2 Foley J. and Vandam A. Fundamentals of Computer Graphics. Addison- Wesley, Reading, Mass., 1984. Google ScholarDigital Library
- 3 Heckbert P.S., and Hanrahan P. Beam tracing polygonal objects. Comput. Graph. 18, 3 (July 1984), 119-127. Google ScholarDigital Library
- 4 Jackson, J.H. Dynamic scanconverted images with a frame buffer display device, Comput. Graph. 14, 3 (July, 1980), 163-169. Google ScholarDigital Library
- 5 Lee, D.T. Shading regions on vector display devises, Comput. Graph. 15, 3 (1981). Google ScholarDigital Library
- 6 Liang Y. and Barsky B.A. An analysis and algorithm for polygon clipping. Commun. ACM 11, 26 (Nov. 1983), 868-877. Google ScholarDigital Library
- 7 Little W.D. and Heuft R. An area shading graphics display system. IEEE Trans. Comput. c-28, 7 (July 1978), 528-530.Google Scholar
- 8 Montani C. and Re M. Vector and raster hidden surface removal using parallel connected stripes. IEEE Comput. Graph. Appl. 7, 7 (July 1987), 14-23.Google ScholarDigital Library
- 9 Newman W.M. and Sproull R.F. Principles of Interactive Computer Graphics. Second ed., Mcgraw-Hill, N.Y. Google ScholarDigital Library
- 10 Sechrest S. and Greenberg D. A visible polygon reconstruction algorithm. Comput. Graph. 15, 3 (1981), 17-26. Google ScholarDigital Library
- 11 Sutherland E.E. and Hodgeman G.W. Reentrant polygon clipping. Commun. ACM 17, 1 (Jan. 1974), 32-42. Google ScholarDigital Library
- 12 Weiler K. and Atherton P. Hidden surface removal using polygon area sorting. In Proceedings of SIG- GRAPH 11, 2 (Summer, 1977), pp. 214-222. Google ScholarDigital Library
- 13 Winberg R. Parallel processing image synthesis and anti-aliasing. Comput. Graph. 15, 3 (Aug. 1981), 55-61. Google ScholarDigital Library
Index Terms
- A generic solution to 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 simple algorithm for Boolean operations on polygons
In this paper a simple and efficient algorithm for computing Boolean operations on polygons is presented. The algorithm works with almost any kind of input polygons: concave polygons, polygons with holes, several contours and self-intersecting edges. ...
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 ...
Reviews
Shawn Neely
An improved algorithm for clipping one polygon to another is described. This fundamental operation in computer graphics is most often used to constrain drawing to a specified rectangular window, and it has already been successfully solved by a number of reasonably efficient algorithms, which are well known to anyone who has ever picked up a computer graphics textbook. The new developments presented in this paper, however, provide a solution that handles more cases and is more efficient than previously published methods, especially for the common case of filling polygons after clipping. Moreover, simple extensions for other Boolean operations between two polygons are presented. I would recommend this paper to teachers and students of introductory computer graphics, to persons specifically interested in rendering, and to anyone interested in implementing or optimizing a basic graphics pipeline.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments