A method for eliminating hidden lines with polyhedra
- 1 January 1971
- journal article
- research article
- Published by SAGE Publications in SIMULATION
- Vol. 16 (1) , 37-41
- https://doi.org/10.1177/003754977101600106
Abstract
A method is given to eliminate hidden lines from line drawings of volumes whose surfaces are a union of polygons. Projected polygons are tested pair- wise for overlap by looking for lines with the property that all vertices of one polygon lie on one side of the line and all vertices of the other pdygon lie on the opposite side. When a pair is found to overlap, hidden line endpoints are found by searching a table that was constructed in the test for overlap. Some results of a program written to demonstrate the method are given.Keywords
This publication has 2 references indexed in Scilit:
- An algorithm for hidden line eliminationCommunications of the ACM, 1969
- The notion of quantitative invisibility and the machine rendering of solidsPublished by Association for Computing Machinery (ACM) ,1967