MétaCan
Menu
Back to cohort
Record W2076065916 · doi:10.1142/s0219467808003064

HARDWARE-ACCELERATED PARALLEL-SPLIT SHADOW MAPS

2008· article· en· W2076065916 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueInternational Journal of Image and Graphics · 2008
Typearticle
Languageen
FieldComputer Science
TopicComputer Graphics and Visualization Techniques
Canadian institutionsnot available
FundersUniversity of Alberta
KeywordsRendering (computer graphics)Computer scienceAnti-aliasingShadow mappingComputer visionComputer graphics (images)Shadow (psychology)AliasingArtificial intelligenceFrustumReal-time renderingMathematicsComputer hardwareGeometry

Abstract

fetched live from OpenAlex

Shadow mapping is well known for its generality and efficiency, thus it has been extensively employed for real-time shadow rendering in diverse applications. However, it suffers from inherent aliasing problem due to its image-based nature. In this paper, we present the parallel-split shadow maps scheme which produces high-quality shadows especially in large-scale and complex scenes. Our scheme splits the view frustum into parts using planes parallel to the view plane, and then generates a shadow map for each part. A fast and robust splitting strategy based on the analysis of shadow-map aliasing is proposed, which results in a moderate aliasing distribution over the depth range. Hardware-accelerated processing is developed to eliminate extra rendering passes which surpass that of standard shadow mapping when synthesizing scene-shadows.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.894
Threshold uncertainty score0.422

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.031
GPT teacher head0.302
Teacher spread0.270 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it