The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Hidden surface removal using polygon area sorting
Abstract
A polygon hidden surface and hidden line removal algorithm is presented. The algorithm recursively subdivides the image into polygon shaped windows until the depth order within the window is found. Accuracy of the input data is preserved.The approach is based on a two-dimensional polygon clipper which is sufficiently general to clip a concave polygon with holes to the borders of a concave polygon with holes.A major advantage of the algorithm is that the polygon form of the output is the same as the polygon form of the input. This allows entering previously calculated images to the system for further processing. Shadow casting may then be performed by first producing a hidden surface removed view from the vantage point of the light source and then resubmitting these tagged polygons for hidden surface removal from the position of the observer. Planar surface detail also becomes easy to represent without increasing the complexity of the hidden surface problem. Translucency is also possible.Calculation times are primarily related to the visible complexity of the final image, but can range from a linear to an exponential relationship with the number of input polygons depending on the particular environment portrayed. To avoid excessive computation time, the implementation uses a screen area subdivision preprocessor to create several windows, each containing a specified number of polygons. The hidden surface algorithm is applied to each of these windows separately. This technique avoids the difficulties of subdividing by screen area down to the screen resolution level while maintaining the advantages of the polygon area sort method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
MACHINE PERCEPTION OF THREE-DIMENSIONAL SOLIDS,
Roberts, L. G. (1963) · Defense Technical Information Center (DTIC) · Cited by 1,551
A Characterization of Ten Hidden-Surface Algorithms
Sutherland, I. E., Sproull, R. F., & Schumacker, R. A. (1974) · ACM Computing Surveys · doi:10.1145/356625.356626 · Cited by 861
The notion of quantitative invisibility and the machine rendering of solids
Appel, A. (1967) · Proceedings of the 1967 22nd national conference on - · doi:10.1145/800196.806007 · Cited by 181
Cited by
Mathematical Elements for Computer Graphics
Mudur, S. P. (1986) · Advances in Computer Graphics I · doi:10.1007/978-3-642-46514-7_2 · Cited by 626
A generic solution to polygon clipping
Vatti, B. R. (1992) · Communications of the ACM · doi:10.1145/129902.129906 · Cited by 450
Computer-generated pen-and-ink illustration
Winkenbach, G., & Salesin, D. H. (1994) · Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94 · doi:10.1145/192161.192184 · Cited by 444
Geometric Type-1 and Type-2 Fuzzy Logic Systems
Coupland, S., & John, R. (2007) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2006.889764 · Cited by 316
Metadata
- Authors
- Weiler, K., & Atherton, P.
- Venue
- Proceedings of the 4th annual conference on Computer graphics and interactive techniques
- Publisher
- ACM
- Published
- 1977-07-20
- Pages
- 214-222
- OpenAlex
- W1972938379
- Cited by
- 299
- References
- 3
- FWCI
- 5.11
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Hidden surface removal using polygon area sorting. https://app.cochat.ai/papers/10.1145/563858.563896
- The paper
- Weiler, K., & Atherton, P. (1977). Hidden surface removal using polygon area sorting. Proceedings of the 4th annual conference on Computer graphics and interactive techniques. https://doi.org/10.1145/563858.563896
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.