{"id":"W2096602114","doi":"10.1007/s00371-011-0670-z","title":"Algorithms for computing diffuse reflection paths in polygons","year":2012,"lang":"en","type":"article","venue":"The Visual Computer","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"University of Ottawa","keywords":"Path (computing); Polygon (computer graphics); Fast path; Longest path problem; Mathematics; Point (geometry); Reflection (computer programming); Path length; Widest path problem; Algorithm; Combinatorics; Computer science; Graph; Shortest path problem; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.000763519,0.0001333767,0.0001312336,0.0001679779,0.0002448101,0.000131165,0.000368073,0.0000497483,0.000002810437],"category_scores_gemma":[0.00001923717,0.0001028368,0.00007102305,0.0005816336,0.00002216645,0.0004251237,0.0002169832,0.0001270269,0.00002600886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006437737,"about_ca_system_score_gemma":0.00003427852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001636967,"about_ca_topic_score_gemma":0.000004248666,"domain_scores_codex":[0.9988107,0.0001285822,0.0002493048,0.000239592,0.0001942326,0.0003775785],"domain_scores_gemma":[0.9992357,0.0003239547,0.00008101125,0.000217902,0.0000677963,0.0000735787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003762071,0.0009922894,0.002540772,0.00003115849,0.00004389178,0.000002418859,0.005312623,0.01652836,0.002100311,0.07673969,0.003072901,0.892598],"study_design_scores_gemma":[0.0005584222,0.0001419101,0.01726308,0.0000126935,0.000004573297,0.00002215041,0.00001478392,0.9743149,0.0009812043,0.00156097,0.004956212,0.0001691536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1737031,0.0001118565,0.8238688,0.000528918,0.001371995,0.0002502936,0.00000126082,0.00009625639,0.00006748075],"genre_scores_gemma":[0.9073156,0.000002908854,0.09041673,0.0008190314,0.001330468,0.00001803371,0.00001262183,0.000009715081,0.00007488811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9577865,"threshold_uncertainty_score":0.4193563,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04957067962426064,"score_gpt":0.351217092553216,"score_spread":0.3016464129289553,"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."}}