Line/Polygon Classification: A Study of the Complexity of Geometric Computation
- 1 April 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 1 (2), 75-88
- https://doi.org/10.1109/mcg.1981.1673886
Abstract
Illuminating the techniques of computational geometry, an analysis of two LPC algorithms compares their efficiency for handling polygon-clipping problems.Keywords
This publication has 24 references indexed in Scilit:
- The polygon packageComputer-Aided Design, 1980
- An algorithm for shading of regions on vector display devicesACM SIGGRAPH Computer Graphics, 1979
- Interference detection among solids and surfacesCommunications of the ACM, 1979
- Geometric Modelling Systems for mechanical design and manufacturingPublished by Association for Computing Machinery (ACM) ,1978
- Hidden surface removal using polygon area sortingACM SIGGRAPH Computer Graphics, 1977
- Representation of many-sided polygons and polygonal lines for rapid processingCommunications of the ACM, 1977
- Reentrant polygon clippingCommunications of the ACM, 1974
- Representation of contours and regions for efficient computer searchCommunications of the ACM, 1973
- A procedure to determine intersections between polyhedral objectsInternational Journal of Parallel Programming, 1972
- An efficient algorith for determining the convex hull of a finite planar setInformation Processing Letters, 1972