{"id":"W1842824552","doi":"10.1007/978-3-642-02017-9_47","title":"The Two-Guard Polygon Walk Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Polygon (computer graphics); Simple polygon; Visibility polygon; Guard (computer science); Computer science; Boundary (topology); Visibility; Point (geometry); Computer graphics (images); Regular polygon; Mathematics; Geometry; Physics; Optics; Mathematical analysis","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003475545,0.0006493485,0.001177898,0.0004746708,0.0008285102,0.001622223,0.001529655,0.002387502,0.01425558],"category_scores_gemma":[0.002417412,0.0005138558,0.0006615461,0.0009261183,0.00110266,0.002670003,0.002051037,0.002171775,0.001886793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004104042,"about_ca_system_score_gemma":0.0006035146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001304381,"about_ca_topic_score_gemma":0.001161596,"domain_scores_codex":[0.9996631,0.0000854479,0.00001373415,0.00008970112,0.00007802418,0.0000699419],"domain_scores_gemma":[0.9994635,0.0002639148,0.00004398215,0.00008427481,0.00003652788,0.0001078065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000410609,0.0001945148,0.0005364859,0.000398635,0.00004727769,0.000536699,0.0002406176,0.1195877,0.002857703,0.7247204,0.02908049,0.1213888],"study_design_scores_gemma":[0.0001309209,0.00005618502,0.0002273435,0.00004907148,0.00001651955,0.0002180369,0.0001608903,0.301066,0.001226418,0.6807186,0.01610665,0.00002344507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1339562,0.001492424,0.7728432,0.002751167,0.0006607496,0.0001709903,0.0009718871,0.0006246674,0.08652868],"genre_scores_gemma":[0.6835185,0.001696849,0.2372774,0.0005359665,0.0003172875,0.0002423546,0.001961964,0.0005400723,0.07390968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01425558,"threshold_uncertainty_score":0.04768968,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01236877948629696,"score_gpt":0.2445929990505315,"score_spread":0.2322242195642346,"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."}}