{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009581354,0.0007135323,0.0006584846,0.0007448412,0.0005257667,0.0009803752,0.002102094,0.0005548556,0.00004948214],"category_scores_gemma":[0.000219162,0.0005972725,0.0005891725,0.0003573105,0.00008628973,0.001263934,0.001948166,0.0009499824,0.0003779354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002884304,"about_ca_system_score_gemma":0.0004403785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004343142,"about_ca_topic_score_gemma":0.000005412767,"domain_scores_codex":[0.9959143,0.00008578684,0.001416396,0.0006827621,0.001046185,0.000854519],"domain_scores_gemma":[0.9964777,0.0004767251,0.0008533055,0.00139162,0.0004941183,0.0003065431],"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.000220188,0.0006639111,0.0006021882,0.001233578,0.0007161489,0.00002109106,0.007273569,0.02927674,0.0001300802,0.8353877,0.0450432,0.07943159],"study_design_scores_gemma":[0.005341121,0.000733902,0.001363363,0.001863325,0.0001234117,0.0001601485,0.0002088864,0.6604897,0.002757846,0.2141936,0.1097424,0.003022222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04109627,0.00007615198,0.9381953,0.001561071,0.005326547,0.001328766,0.001052151,0.000442861,0.01092082],"genre_scores_gemma":[0.9146788,0.00005935758,0.07604205,0.003738735,0.001312664,0.0004030147,0.001907253,0.00009304514,0.001765096],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8735825,"threshold_uncertainty_score":0.9996479,"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."}}