{"id":"W2109083408","doi":"10.1142/s0218195902000803","title":"ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; Simple polygon; Simple (philosophy); Decomposition; Regular polygon; Convex polygon; Geometry","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.002073558,0.002657979,0.002026265,0.001480063,0.001160215,0.004256525,0.002694675,0.001303077,0.02088587],"category_scores_gemma":[0.01054512,0.00100546,0.001895085,0.002556267,0.001557756,0.007038219,0.003651664,0.002180699,0.004198999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002560883,"about_ca_system_score_gemma":0.002124116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006391433,"about_ca_topic_score_gemma":0.01048567,"domain_scores_codex":[0.996894,0.0005186019,0.0001547068,0.0004801583,0.001072493,0.0008799214],"domain_scores_gemma":[0.9917563,0.00546359,0.0004730847,0.001353178,0.0005330706,0.0004206968],"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.005222025,0.0004087643,0.003118285,0.001849253,0.0002494964,0.0006447813,0.000572039,0.4091238,0.05192753,0.07927399,0.04402348,0.4035866],"study_design_scores_gemma":[0.0003549067,0.0002772154,0.0007898372,0.0001355543,0.0001380939,0.0002659449,0.0001969507,0.89648,0.01344304,0.07703386,0.0108378,0.00004689625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1309427,0.006111367,0.8002225,0.002590013,0.0004325396,0.0003529279,0.001852216,0.009268601,0.04822722],"genre_scores_gemma":[0.501885,0.003053965,0.4679694,0.000809013,0.0003230848,0.0005946669,0.005020917,0.002784707,0.01755927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02088587,"threshold_uncertainty_score":0.06987023,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01666600020750904,"score_gpt":0.2948917396336267,"score_spread":0.2782257394261177,"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."}}