{"id":"W2166438223","doi":"","title":"Decomposing Polygons Into Diameter Bounded Components","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Simple polygon; Polygon (computer graphics); Polygon covering; Visibility polygon; Mathematics; Combinatorics; Bounded function; Rectilinear polygon; Heuristics; Bounding overwatch; Decomposition; Intersection (aeronautics); Point in polygon; Reduction (mathematics); Polygon mesh; Algorithm; Computer science; Monotone polygon; Mathematical optimization; Geometry; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003866566,0.0003033126,0.0002588804,0.00130227,0.0006514288,0.0006134442,0.0006826255,0.0001225922,0.0002680276],"category_scores_gemma":[0.0001809169,0.000341575,0.0001134135,0.00143735,0.00008901035,0.0005049095,0.00005796626,0.0002709491,0.0004831516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004091973,"about_ca_system_score_gemma":0.001581594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002044334,"about_ca_topic_score_gemma":0.00267872,"domain_scores_codex":[0.9975237,0.000202982,0.0004089251,0.0006947588,0.0005944716,0.0005751761],"domain_scores_gemma":[0.9979377,0.0003552489,0.0001273035,0.0004235798,0.0004096693,0.000746445],"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.000005461706,0.00008540339,0.0007454548,0.00001110355,0.00004795249,0.00003325393,0.0002211072,0.03046508,0.0002928236,0.9484866,0.001475903,0.01812992],"study_design_scores_gemma":[0.001575264,0.0003137624,0.02868871,0.0001112598,0.00002198981,0.0001731021,0.00008162184,0.4710554,0.001331272,0.44336,0.05183076,0.001456874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1090209,0.0001376757,0.8703347,0.002754258,0.001331771,0.0002924673,0.000023627,0.0001470496,0.01595753],"genre_scores_gemma":[0.8806578,0.000004220663,0.1160328,0.002790922,0.00007071046,0.00001815733,0.0001225858,0.00001698243,0.0002858025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7716368,"threshold_uncertainty_score":0.9999036,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03263138537768494,"score_gpt":0.2572229821769649,"score_spread":0.22459159679928,"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."}}