A Solution to the Hidden Surface Problem¶
Newell, M. E., Newell, & Sancha, T. L. (1972). A Solution to the Hidden Surface Problem. Proceedings of the ACM Annual Conference, 1, 443-450.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Occlusion and Silhouette Check
- The problem it polices is the same one computer graphics names the visibility or hidden-surface problem, and its depth-cycle failure is exactly what breaks the painter's algorithm when three surfaces overlap in a loop.
This sourceTreats hidden-surface visibility as an ordering problem and resolves cyclic polygon overlap that defeats a simple back-to-front painter ordering.
- The problem it polices is the same one computer graphics names the visibility or hidden-surface problem, and its depth-cycle failure is exactly what breaks the painter's algorithm when three surfaces overlap in a loop.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:92cd40e996fa · see in the full table