{"id":"W2342776777","doi":"10.4230/lipics.isaac.2016.17","title":"On $r$-Guarding Thin Orthogonal Polygons","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Combinatorics; Polygon covering; Simple polygon; Point in polygon; Mathematics; Star-shaped polygon; Guard (computer science); Visibility polygon; Rectangle; Rectilinear polygon; Polygon mesh; Time complexity; Regular polygon; Discrete mathematics; Geometry; Computer science; Convex set","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.0007715671,0.0007486102,0.001063688,0.0005640617,0.00066084,0.001049826,0.00115629,0.0008058643,0.005288797],"category_scores_gemma":[0.004457605,0.0005507872,0.001193088,0.000983827,0.001596154,0.002736502,0.002692235,0.001249925,0.0009486895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005337745,"about_ca_system_score_gemma":0.0006277226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002127545,"about_ca_topic_score_gemma":0.002301167,"domain_scores_codex":[0.9992663,0.0001430809,0.0000524775,0.0002077612,0.0001474596,0.000182827],"domain_scores_gemma":[0.9979103,0.001133296,0.0002439355,0.000467024,0.0001013737,0.0001440157],"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.001036305,0.000297157,0.006566371,0.0009790178,0.0001023651,0.001235134,0.0009172924,0.5724452,0.02461772,0.1469309,0.0132703,0.2316023],"study_design_scores_gemma":[0.0001179034,0.0002010313,0.00107648,0.0001240102,0.00004542466,0.0005975194,0.0004273959,0.7560911,0.01406609,0.2168933,0.01031422,0.00004563986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2446762,0.0005773568,0.7402787,0.0006784415,0.0001091656,0.000220251,0.001169611,0.001896342,0.01039386],"genre_scores_gemma":[0.5008798,0.0005874209,0.4902394,0.0002482967,0.00006437681,0.0001725393,0.002517549,0.0006753466,0.004615203],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005288797,"threshold_uncertainty_score":0.0176928,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01956156686949621,"score_gpt":0.2723352731324604,"score_spread":0.2527737062629641,"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."}}