{"id":"W2106160424","doi":"","title":"I/O efficient path traversal in well-shaped tetrahedral meshes.","year":2010,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Tree traversal; Tetrahedron; Intersection (aeronautics); Polygon mesh; Path (computing); Regular polygon; Plane (geometry); Sequence (biology); Combinatorics; Computer science; Space (punctuation); Mathematics; Topology (electrical circuits); Algorithm; Geometry; Engineering","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.0002664281,0.00008877004,0.00008348879,0.0001677777,0.0000546315,0.00008539504,0.0003301091,0.00005217044,0.0002185548],"category_scores_gemma":[0.00001672228,0.00007931054,0.00003982208,0.0005046757,0.00001912437,0.0001068103,0.00007165591,0.0001640244,0.0001534181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001628175,"about_ca_system_score_gemma":0.00007461858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000502424,"about_ca_topic_score_gemma":0.000176351,"domain_scores_codex":[0.9991446,0.00002479696,0.0001697322,0.0002322156,0.000237425,0.0001912369],"domain_scores_gemma":[0.999575,0.00006623049,0.00002828128,0.0002133575,0.00004313951,0.00007404872],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002509209,0.0008297389,0.007874683,0.00001852667,0.00001824435,0.00006604104,0.00298139,0.1112676,0.08066051,0.6988055,0.002130626,0.09532199],"study_design_scores_gemma":[0.000357016,0.00003146771,0.02940862,0.000002233331,0.000001003942,0.00001255058,0.00002191218,0.9654362,0.001793582,0.000865722,0.001945928,0.000123782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.593977,0.000006798437,0.3992867,0.0003238673,0.0006615712,0.00008765068,4.500126e-7,0.00007371839,0.005582253],"genre_scores_gemma":[0.9605036,6.662597e-7,0.03872026,0.000275607,0.00008477652,0.000005807167,0.000003903207,0.000003335082,0.0004020686],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8541685,"threshold_uncertainty_score":0.323419,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007011304426586608,"score_gpt":0.2234940786482438,"score_spread":0.2164827742216572,"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."}}