Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
F.J. McGrath (1971) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: