MétaCan
Menu
Back to cohort
Record W2377255867

A New Frustum Culling Algorithm

2009· article· en· W2377255867 on OpenAlexvenueno aff
Huang Sui

Bibliographic record

VenueMicrocomputer applications · 2009
Typearticle
Languageen
FieldComputer Science
TopicArtificial Intelligence in Games
Canadian institutionsnot available
Fundersnot available
KeywordsFrustumOctreeComputer scienceIntersection (aeronautics)MidpointAlgorithmEquilateral triangleCullingBounding overwatchCube (algebra)Node (physics)ComputationProcess (computing)Computer graphics (images)Artificial intelligenceMathematicsGeometry
DOInot available

Abstract

fetched live from OpenAlex

This paper puts forward a new frustum culling algorithm base on the frequently-used one.It decides whether the node is in the frustum or not by points of intersection.The points of intersection are composed by the ray of vertexes and six planes.The frequently-used culling algorithm needs to compute the distance between points and planes,but the new one only needs to check the intersection between ray of vertexes and planes.It requires less computation than the frequently-used culling algorithm.Computational process is more intuitive.At the same time game level is divided by octree.Each node of the octree is a cube(also bounding box),which makes frustum more convenient.

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.

How this classification was reachedexpand

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.947
Threshold uncertainty score1.000

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.001

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.014
GPT teacher head0.273
Teacher spread0.259 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designOther design
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueMicrocomputer applicationsSame topicArtificial Intelligence in GamesFrench-language works237,207