{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003926903,0.0002287546,0.000256494,0.0003536281,0.0001550877,0.0002389625,0.0005389483,0.0001607142,0.00003590045],"category_scores_gemma":[0.0001616265,0.0002297664,0.0000774591,0.0006546561,0.00001003715,0.0004491316,0.00006241493,0.0002638881,0.00005340134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007210483,"about_ca_system_score_gemma":0.0001923951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001944274,"about_ca_topic_score_gemma":0.001036946,"domain_scores_codex":[0.9983302,0.0001168442,0.0003853585,0.0005372946,0.0003647904,0.0002655098],"domain_scores_gemma":[0.9990737,0.0002010649,0.000170138,0.0003564423,0.0001287845,0.00006983503],"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.00004944532,0.000148381,0.0005528242,0.000320629,0.00002815174,0.00003409475,0.005565753,0.005604523,0.003176078,0.8039498,0.002780393,0.1777899],"study_design_scores_gemma":[0.001773408,0.0005766387,0.05661881,0.0007784012,0.00003950056,0.00005239917,0.003025615,0.6539662,0.03624063,0.189576,0.05399954,0.003352833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3730817,0.0006621548,0.5898521,0.0002398049,0.002160242,0.0004358503,0.000005112678,0.0003299803,0.0332331],"genre_scores_gemma":[0.9706284,0.00003160027,0.01905489,0.000260946,0.0001610216,0.00004547898,0.0004966897,0.00001704107,0.009303927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6483617,"threshold_uncertainty_score":0.9369602,"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."}}