article

Free access

Reentrant polygon clipping

Authors:

Ivan E. Sutherland,

Gary W. HodgmanAuthors Info & Claims

Communications of the ACM, Volume 17, Issue 1

Pages 32 - 42

https://doi.org/10.1145/360767.360802

Published: 01 January 1974 Publication History

Abstract

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 algorithms permit clipping against irregular convex windows.

Polygons to be clipped are represented as an ordered sequence of vertices without repetition of first and last, in marked contrast to representation as a collection of edges as was heretofore the common procedure. Output polygons have an identical format, with new vertices introduced in sequence to describe any newly-cut edge or edges. The algorithms easily handle the particularly difficult problem of detecting that a new vertex may be required at a corner of the clipping window.

The algorithms described achieve considerable simplicity by clipping separately against each clipping plane or window boundary. Code capable of clipping the polygon against a single boundary is reentered to clip against subsequent boundaries. Each such reentrant stage of clipping need store only two vertex values and may begin its processing as soon as the first output vertex from the preceeding stage is ready. Because the same code is reentered for clipping against subsequent boundaries, clipping against very complex window shapes is practical.

For perspective applications in three dimensions, a six-plane truncated pyramid is chosen as the clipping volume. The two additional planes parallel to the projection screen serve to limit the range of depth preserved through the projection. A perspective projection method which provides for arbitrary view angles and depth of field in spite of simple fixed clipping planes is described. This method is ideal for subsequent hidden-surface computations.

References

[1]

Archuleta, Michael. Computer Science Technical Memos 7002, 7102, 7105, and 7203 pertaining to Watkins' Hiddenline processing, U. of Utah, Salt Lake City, Utah, Nov. 1970, Oct. 1971, May 1971, and Mar. 1972 respectively.

[2]

Bouknight, W.J. A procedure for generation of threedimensional half-toned computer graphics representations. Comm. ACM 13, 9 (Sept. 1970), 527-536.

Digital Library

[3]

Galimberti, R. and Montanari U. An algorithm for hiddenline elimination. Comm. ACM 12,4 (Apr. 1969), 206-211.

Digital Library

[4]

Loutrel, P.P. A solution to the hidden-line problem for computer-drawn polyhedra. NYU Eng. and Sci. Dept. of EE Rept. 400-167, Sep. 1967. (Also IEEE Tran. on Computers EC-1913}, Mar. 1970.)

[5]

Mathematical Applications Group Inc. (MAGI). 3-D simulated graphics. Datamation (Feb. 1968).

[6]

Moore, E. Shortest Path Through a Maze. Ann. of Computation Laboratory of Harvard U., Vol. 30, Harvard U. Press, Cambridge, Mass. pp. 285-292, 1959.

[7]

Newell, M.E., Newell, R.G., and Sancha, T.L. A new approach to the shaded picture problem. Proc. ACM Nat. Conf., Boston, Aug. 1972.

[8]

Newman, W.M.; and Sprouli, R.F. Prhrciples ofblteractive Computer Graphics. }McGraw-Hill, New York, 1973. (See especially Chap. 13).

Digital Library

[9]

Newman, W.M. An informal graphics system based on the LOGO language. Proc. AFIPS 1973 FJCC, Vol. 42, AFIPS Press, Montvale, N.J., pp. 651-655.

[10]

Roberts, L.G. Homogeneous matrix representation and manipulation of N-dimensional constructs. MIT Lincoln Laboratory MS 1405, May 1965.

[11]

Sproull, R.F., and Sutherland I.E. A clipping divider. Proc. 1968 AFIPS FJCC, Vol. 33, AFIPS Press, Montvale, N.J., pp. 765-775.

[12]

Sutherland I.E. A head-mounted three-dimensional display. Proc. 1968 AFIPS FJCC, Vol. 33, AFIPS Press, Montvale, N.J., pp. 757-764.

[13]

Warnock, J.E. A hidden-surface algorithm for computergenerated halftone pictures. Computer Science Dept., U. of Utah, TR 4-15, June 1969.

[14]

Weiss, R.A. BE VISION, A package of IBM 7090 FORTRAN programs to draw orthographic views of combinations of planes and quadric surfaces. J.ACM 13, 2 (Apr. 1966), 194-204.

Digital Library

[15]

Zajac, E.E., and Behler, B.L. A generalized window-shield routine. UAIDE Proc. 8th Ann. Meeting, Nov. 1969, pp. 351-388.

Cited By

Schemmel APalakurthy SZope ACollins EBhushan S(2024)Development and Verification of Coupled Fluid–Structure Interaction SolverComputation10.3390/computation1206012912:6(129)Online publication date: 20-Jun-2024
https://doi.org/10.3390/computation12060129
Fan JZuo JSun GShi ZGao YZhang Y(2024)Multicore Parallelized Spatial Overlay Analysis Algorithm Using Vector Polygon Shape Complexity Index OptimizationApplied Sciences10.3390/app1405200614:5(2006)Online publication date: 28-Feb-2024
https://doi.org/10.3390/app14052006
Birgin EGardenghi JLaurain A(2024)Bounds on the Optimal Radius When Covering a Set with Minimum Radius Identical DisksMathematics of Operations Research10.1287/moor.2022.010449:3(1855-1889)Online publication date: Aug-2024
https://doi.org/10.1287/moor.2022.0104
Show More Cited By

Recommendations

An analysis and algorithm for polygon clipping
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 ...
Efficient clipping of arbitrary polygons

Clipping 2D polygons is one of the basic routines in computer graphics. In rendering complex 3D images it has to be done several thousand times. Efficient algorithms are therefore very important. We present such an efficient algorithm for clipping ...

Comments

Information & Contributors

Information

Published In

Copyright © 1974 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1974

Published in CACM Volume 17, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

428
Total Citations
View Citations
4,149
Total Downloads

Downloads (Last 12 months)613
Downloads (Last 6 weeks)51

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Schemmel APalakurthy SZope ACollins EBhushan S(2024)Development and Verification of Coupled Fluid–Structure Interaction SolverComputation10.3390/computation1206012912:6(129)Online publication date: 20-Jun-2024
https://doi.org/10.3390/computation12060129
Fan JZuo JSun GShi ZGao YZhang Y(2024)Multicore Parallelized Spatial Overlay Analysis Algorithm Using Vector Polygon Shape Complexity Index OptimizationApplied Sciences10.3390/app1405200614:5(2006)Online publication date: 28-Feb-2024
https://doi.org/10.3390/app14052006
Birgin EGardenghi JLaurain A(2024)Bounds on the Optimal Radius When Covering a Set with Minimum Radius Identical DisksMathematics of Operations Research10.1287/moor.2022.010449:3(1855-1889)Online publication date: Aug-2024
https://doi.org/10.1287/moor.2022.0104
Mallika Kankanamalage BPuri SPrasad S(2024)Extending Segment Tree for Polygon Clipping and Parallelizing using OpenMP and OpenACC DirectivesProceedings of the 53rd International Conference on Parallel Processing10.1145/3673038.3673141(273-283)Online publication date: 12-Aug-2024
https://dl.acm.org/doi/10.1145/3673038.3673141
Lu HChang WHedstrom TLi T(2024)Real-Time Path Guiding Using Bounding Voxel SamplingACM Transactions on Graphics10.1145/365820343:4(1-14)Online publication date: 19-Jul-2024
https://dl.acm.org/doi/10.1145/3658203
Gong MChen X(2024)3D Surface-Closed Mesh Clipping Based on Polygonal Partitioning for Surgical PlanningIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2022.323073930:7(3374-3385)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1109/TVCG.2022.3230739
Huang JYang RGao WZhan X(2024)Geometric Characterization on GNSS Direct Position Estimation in Navigation DomainIEEE Transactions on Aerospace and Electronic Systems10.1109/TAES.2024.337195260:4(4105-4123)Online publication date: Aug-2024
https://doi.org/10.1109/TAES.2024.3371952
Pang ZZhu B(2024)An Electrostatic Integral Equation Method Compatible with Non-conformal Meshes2024 Photonics & Electromagnetics Research Symposium (PIERS)10.1109/PIERS62282.2024.10618186(1-7)Online publication date: 21-Apr-2024
https://doi.org/10.1109/PIERS62282.2024.10618186
Li XLiu DWu YWu XZhao LGao J(2024)Fast-Poly: A Fast Polyhedral Algorithm for 3D Multi-Object TrackingIEEE Robotics and Automation Letters10.1109/LRA.2024.34758829:11(10519-10526)Online publication date: Nov-2024
https://doi.org/10.1109/LRA.2024.3475882
Gómez-Molina PSanz-Lorenzo LCarpio J(2024)A stable conservative Lagrange-Galerkin scheme to pure convection equations with mesh intersectionJournal of Computational Physics10.1016/j.jcp.2023.112625497:COnline publication date: 15-Jan-2024
https://dl.acm.org/doi/10.1016/j.jcp.2023.112625
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents