The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Automatic Creation of Object Hierarchies for Ray Tracing
Abstract
Intersection calculations dominate the run time of canonical ray tracers. A common algorithm to reduce the number of intersection tests required is the intersection of rays with a tree of extents, rather than the whole database of objects. A shortcoming of this method is that these trees are difficult to generate. Additionally, manually generated trees can be poor, greatly reducing the run-time improvement available. We present methods for evaluation of these trees in approximate number of intersection calculations required and for automatic generation of good trees. These methods run in O(nlogn) expected time where n is the number of objects in the scene. We report some examples of speedups.
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
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
An improved illumination model for shaded display
Whitted, T. (1980) · Communications of the ACM · doi:10.1145/358876.358882 · Cited by 1,768
Kay, T. L., & Kajiya, J. T. (1986) · ACM SIGGRAPH Computer Graphics · doi:10.1145/15886.15916 · Cited by 467
ARTS: Accelerated Ray-Tracing System
Fujimoto, A., Tanaka, T., & Iwata, K. (1986) · IEEE Computer Graphics and Applications · doi:10.1109/mcg.1986.276715 · Cited by 440
Improved Computational Methods for Ray Tracing
Weghorst, H., Hooper, G., & Greenberg, D. P. (1984) · ACM Transactions on Graphics · doi:10.1145/357332.357335 · Cited by 359
A 3-dimensional representation for fast rendering of complex scenes
Rubin, S. M., & Whitted, T. (1980) · Proceedings of the 7th annual conference on Computer graphics and interactive techniques - SIGGRAPH '80 · doi:10.1145/800250.807479 · Cited by 306
Cited by
OBBTree: a hierarchical structure for rapid interference detection
Gottschalk, S., Lin, M. C., & Manocha, D. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237244 · Cited by 2,081
Efficient collision detection using bounding volume hierarchies of k-DOPs
Klosowski, J. T., Held, M., Mitchell, J. S. B., Sowizral, H., & Zikan, K. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.675649 · Cited by 873
OptiX: a general purpose ray tracing engine
Parker, S. G., Bigler, J., Dietrich, A., Friedrich, H., Hoberock, J., Luebke, D., McAllister, D., McGuire, M., Morley, K., Robison, A., et al. (2010) · ACM Transactions on Graphics · doi:10.1145/1778765.1778803 · Cited by 684
Collision Detection and Response for Computer Animation
Moore, M., & Wilhelms, J. (1988) · ACM SIGGRAPH Computer Graphics · doi:10.1145/378456.378528 · Cited by 678
Collision Detection for Deformable Objects
Teschner, M., Kimmerle, S., Heidelberger, B., Zachmann, G., Raghupathi, L., Fuhrmann, A., Cani, M. ‐., Faure, F., Magnenat‐Thalmann, N., Strasser, W., et al. (2005) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2005.00829.x · Cited by 507
Metadata
- Authors
- Goldsmith, J., & Salmon, J.
- Venue
- IEEE Computer Graphics and Applications
- Published
- 1987-05
- Volume
- 7
- Issue
- 5
- Pages
- 14-20
- ISSN
- 0272-1716 (ISSN-L)
- OpenAlex
- W1991777702
- Cited by
- 399
- References
- 6
- FWCI
- 8.54
- Type
- journal article
- 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
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.