{"id":"W1964408754","doi":"10.1109/rt.2008.4634653","title":"kd-Tree traversal techniques","year":2008,"lang":"en","type":"article","venue":"","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tree traversal; Computer science; Graph traversal; Tree (set theory); Frustum; Algorithm; Mathematics; Combinatorics; Geometry","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001052703,0.00009509989,0.00009711531,0.0001735347,0.0001218304,0.00006012071,0.0006701036,0.00004861626,0.0000221294],"category_scores_gemma":[0.000005081207,0.00008401697,0.00006349394,0.0004383232,0.00004319249,0.0003158213,0.0001950617,0.0000638906,0.0000164511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001117422,"about_ca_system_score_gemma":0.00003471892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002661956,"about_ca_topic_score_gemma":0.000004874714,"domain_scores_codex":[0.9992361,0.00002313065,0.0001525981,0.000247515,0.0001881424,0.0001524952],"domain_scores_gemma":[0.9993924,0.00002219724,0.00003554873,0.0004104935,0.0000767563,0.00006259644],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[5.203633e-7,0.00003977002,0.0007134828,0.000001834214,0.00000413931,0.00001522412,0.000194775,8.280128e-8,0.0002219316,0.9546401,0.01458586,0.02958229],"study_design_scores_gemma":[0.0004518092,0.0006617511,0.01330878,0.00003410668,0.000006057197,0.0004188695,0.00001615667,0.1594407,0.4643792,0.0858917,0.2742402,0.001150728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00148846,0.00001887045,0.9742841,0.0002283963,0.0000704824,0.00008994857,2.544523e-7,0.001875114,0.0219444],"genre_scores_gemma":[0.7244394,0.0001181132,0.2733963,0.001047484,0.00006173615,0.00001587337,0.000001598429,0.000008698968,0.0009107805],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8687484,"threshold_uncertainty_score":0.3426113,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02468525600195189,"score_gpt":0.26996481641171,"score_spread":0.2452795604097581,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}