{"id":"W2895069531","doi":"10.22215/etd/2014-10404","title":"Obstacle-Avoiding Path Existence Queries in a Simple Polygon","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Simple polygon; Obstacle; Disjoint sets; Path (computing); Set (abstract data type); Simple (philosophy); Regular polygon; Computer science; Convex polygon; Computational geometry; Mathematics; Visibility polygon; Polygon covering; Plane (geometry); Algorithm; Combinatorics; Geometry; Geography","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.0005186378,0.0004340755,0.0009487741,0.0007174357,0.0009341915,0.001480141,0.001121158,0.001075836,0.004141405],"category_scores_gemma":[0.004927624,0.0005489707,0.0007039933,0.001371766,0.0008269921,0.00275794,0.002108017,0.0008041097,0.0009519088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005085681,"about_ca_system_score_gemma":0.0005178709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002570831,"about_ca_topic_score_gemma":0.00239638,"domain_scores_codex":[0.9989654,0.0001537437,0.00008554892,0.0002374802,0.0004275815,0.0001301985],"domain_scores_gemma":[0.9980375,0.001246915,0.0001443947,0.0003210019,0.0001541186,0.00009604844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003433578,0.0004764667,0.007076222,0.001433086,0.000173318,0.003179828,0.002080948,0.3625069,0.06687104,0.143783,0.03683926,0.3721463],"study_design_scores_gemma":[0.0002224468,0.0002810884,0.001385969,0.0001049176,0.00005992764,0.0007142029,0.0007851453,0.8116334,0.02687045,0.1305951,0.02729002,0.0000572086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2846858,0.001110567,0.683566,0.001237063,0.0001560164,0.0004235306,0.003287238,0.006002309,0.01953157],"genre_scores_gemma":[0.7101989,0.0005627034,0.2783293,0.0001488908,0.00006338664,0.0001527718,0.004462826,0.0005002153,0.005580832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004141405,"threshold_uncertainty_score":0.01385444,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0138925241113814,"score_gpt":0.2613839704125718,"score_spread":0.2474914463011904,"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."}}