{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005607545,0.00016291,0.0002337537,0.0006562556,0.0002249456,0.0001784421,0.001294066,0.00006065159,0.0002463222],"category_scores_gemma":[0.0001481013,0.0001369211,0.0002645249,0.0007684001,0.00009379523,0.0004295115,0.00009248865,0.0001678012,0.00008544827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001055449,"about_ca_system_score_gemma":0.0001166015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001601866,"about_ca_topic_score_gemma":3.481354e-7,"domain_scores_codex":[0.9977319,0.00007857298,0.0008149077,0.0002369202,0.0009706588,0.0001670474],"domain_scores_gemma":[0.9944474,0.002325256,0.0008120943,0.0002412458,0.002077721,0.00009626452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006337706,0.0007599218,0.00005592541,0.0000154536,0.0003837796,0.000003055708,0.0001650147,0.2134324,0.001731528,0.7081432,0.01633288,0.05891353],"study_design_scores_gemma":[0.001465059,0.000463837,0.001403276,0.00004885957,0.00005374891,0.0002320455,0.00003058647,0.3730728,0.003166693,0.5532678,0.06648555,0.0003097704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01575254,0.0002626515,0.9758973,0.006392042,0.000317101,0.0004934784,0.0000905209,0.00002750754,0.0007668269],"genre_scores_gemma":[0.9495421,0.00002506858,0.04812949,0.001289469,0.0005682984,0.0001140101,0.00009678868,0.00001433149,0.0002204596],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9337896,"threshold_uncertainty_score":0.5583482,"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."}}