{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001125246,0.001443982,0.001123629,0.002003898,0.0008469215,0.002260271,0.002646514,0.001382077,0.00699872],"category_scores_gemma":[0.007023825,0.001141344,0.001444517,0.002149594,0.001297793,0.002571279,0.003492668,0.002622421,0.002261813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008826879,"about_ca_system_score_gemma":0.000933698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002293094,"about_ca_topic_score_gemma":0.003974451,"domain_scores_codex":[0.9992842,0.0001457316,0.00003416397,0.0001094129,0.0003548958,0.00007164563],"domain_scores_gemma":[0.997891,0.001164918,0.0001228046,0.0003456374,0.0003829405,0.00009275456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000394056,0.000128454,0.001128178,0.0003362889,0.00007225456,0.0001320309,0.0004773435,0.4218151,0.008549061,0.1808101,0.005538492,0.3806187],"study_design_scores_gemma":[0.00004858142,0.00003680267,0.00008350737,0.00002473151,0.00001589248,0.00004968173,0.00007390755,0.9349227,0.003077316,0.05851373,0.003139228,0.00001399641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003238823,0.00004676527,0.9949542,0.000020656,0.00001277,0.00002820978,0.00003158815,0.0004841374,0.001182884],"genre_scores_gemma":[0.07506392,0.0002396359,0.920919,0.00003670211,0.00002563768,0.0001459931,0.0003342895,0.0005670449,0.002667761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00699872,"threshold_uncertainty_score":0.02341306,"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."}}