{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002729485,0.0008981554,0.0006979007,0.0005392303,0.0005110038,0.00136767,0.0009649778,0.0005886924,0.003551701],"category_scores_gemma":[0.001714321,0.0006161923,0.0008323995,0.0008970696,0.0007539928,0.002034223,0.002074296,0.001196242,0.0009303156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006965442,"about_ca_system_score_gemma":0.000508296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001284108,"about_ca_topic_score_gemma":0.001748893,"domain_scores_codex":[0.9995525,0.000053552,0.00003114856,0.0001432312,0.0001229385,0.00009656604],"domain_scores_gemma":[0.9991652,0.0002902556,0.0001484651,0.0002407001,0.00006312806,0.00009233718],"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.0005972388,0.0002239728,0.003462685,0.0008155358,0.00006950741,0.001376106,0.000651355,0.4886845,0.1010113,0.1662908,0.01170342,0.2251136],"study_design_scores_gemma":[0.000090031,0.0002963895,0.002293366,0.0001271149,0.0000753128,0.001653644,0.0004521676,0.7036247,0.03453035,0.2086436,0.04817586,0.00003751713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1744897,0.001000639,0.801172,0.0005075769,0.00008845341,0.0002613119,0.0007393866,0.0008616498,0.0208792],"genre_scores_gemma":[0.4711311,0.001252208,0.5132196,0.000277424,0.0001059923,0.000270332,0.002235706,0.0002886444,0.011219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003551701,"threshold_uncertainty_score":0.01188159,"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."}}