{"id":"W7110402696","doi":"10.4230/lipics.socg.2025.20","title":"Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; University of Ottawa; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Trafikverket; Vetenskapsrådet; National Science Foundation","keywords":"Boundary (topology); Simple polygon; Polygon (computer graphics); Visibility polygon; Piecewise linear function; Merge (version control); Time complexity; Simple (philosophy); Piecewise","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.001157831,0.002625959,0.002257721,0.001327228,0.002072757,0.003400757,0.005105129,0.003017358,0.01772398],"category_scores_gemma":[0.006156764,0.001075336,0.002773088,0.003569046,0.001578842,0.006833249,0.003273567,0.003856891,0.004295752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00311719,"about_ca_system_score_gemma":0.002856033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008607207,"about_ca_topic_score_gemma":0.01202537,"domain_scores_codex":[0.998111,0.0002983337,0.0001120463,0.0005452346,0.000365815,0.0005676014],"domain_scores_gemma":[0.996323,0.002424186,0.0002507516,0.000640058,0.0002114024,0.0001506183],"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.0005903977,0.0008402819,0.001059562,0.001589443,0.0001571238,0.0003497183,0.0007085245,0.4329241,0.004687691,0.1721913,0.07625411,0.3086478],"study_design_scores_gemma":[0.0002825403,0.00009263313,0.0003224589,0.000066409,0.00006802237,0.0003069399,0.0003310517,0.6896376,0.002080643,0.2877144,0.01905687,0.00004034249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03574586,0.002912606,0.9198285,0.003000033,0.0002507373,0.0005253051,0.001802114,0.007341607,0.02859316],"genre_scores_gemma":[0.2294671,0.001633769,0.7476922,0.0007283681,0.0002859503,0.0006353534,0.00470303,0.001492741,0.01336162],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01772398,"threshold_uncertainty_score":0.05929261,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009852901843521469,"score_gpt":0.2450447533529187,"score_spread":0.2351918515093972,"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."}}