The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Hierarchical geometric models for visible surface algorithms
Open accessAbstract
The geometric structure inherent in the definition of the shapes of three-dimensional objects and environments is used not just to define their relative motion and placement, but also to assist in solving many other problems of systems for producing pictures by computer. By using an extension of traditional structure information, or a geometric hierarchy, five significant improvements to current techniques are possible. First, the range of complexity of an environment is greatly increased while the visible complexity of any given scene is kept within a fixed upper limit. Second, a meaningful way is provided to vary the amount of detail presented in a scene. Third, “clipping” becomes a very fast logarithmic search for the resolvable parts of the environment within the field of view. Fourth, frame to frame coherence and clipping define a graphical “working set,” or fraction of the total structure that should be present in primary store for immediate access by the visible surface algorithm. Finally, the geometric structure suggests a recursive descent, visible surface algorithm in which the computation time potentially grows linearly with the visible complexity of the scene.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Illumination for computer generated pictures
Phong, B. T. (1975) · Communications of the ACM · doi:10.1145/360825.360839 · Cited by 3,000
Sketchpad: a man-machine graphical communication system
Sutherland, I. E. (1963) · Proceedings of the May 21-23, 1963, spring joint computer conference on - AFIPS '63 (Spring) · doi:10.1145/1461551.1461591 · Cited by 1,821
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 working set model for program behavior
Denning, P. J. (1983) · Communications of the ACM · doi:10.1145/357980.357997 · Cited by 845
A subdivision algorithm for computer display of curved surfaces.
Catmull, E. E. (1974) · Cited by 715
Continuous Shading of Curved Surfaces
Gouraud, H. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223313 · Cited by 700
The working set model for program behavior
Denning, P. J. (1968) · Communications of the ACM · doi:10.1145/363095.363141 · Cited by 662
The Utilization of Procedure Models in Digital Image Synthesis
Newell, M. E. (1975) · Defense Technical Information Center (DTIC) · doi:10.21236/ada039008 · Cited by 51
Cited by
Hoppe, H. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237216 · Cited by 2,817
An improved illumination model for shaded display
Whitted, T. (1980) · Communications of the ACM · doi:10.1145/358876.358882 · Cited by 1,768
Geometric modeling using octree encoding
Meagher, D. (1982) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(82)90104-6 · Cited by 1,266
QuickTime VR: an image-based approach to virtual environment navigation
Chen, S. E. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218395 · Cited by 1,160
A breadth-first survey of eye-tracking applications
Duchowski, A. T. (2002) · Behavior Research Methods, Instruments, & Computers · doi:10.3758/bf03195475 · Cited by 1,061
Metadata
- Authors
- Clark, J. H.
- Venue
- Communications of the ACM
- Published
- 1976-10
- Volume
- 19
- Issue
- 10
- Pages
- 547-554
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2051314392
- Cited by
- 778
- References
- 8
- FWCI
- 16.70
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.