{"id":"W1965735113","doi":"10.1016/j.comgeo.2006.03.004","title":"Algorithms for optimal area triangulations of a convex polygon","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Regular polygon; Convex polygon; Rectilinear polygon; Polygon covering; Star-shaped polygon; Combinatorics; Computer science; Mathematics; Mathematical optimization; Algorithm; Geometry; Convex set; Convex optimization; Simple polygon","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003202569,0.0001573381,0.0002366492,0.0005591275,0.0001759296,0.00008652992,0.0003698591,0.00007436246,0.00003249698],"category_scores_gemma":[0.00008988988,0.0001686076,0.0001636126,0.001246671,0.00005570159,0.0003632288,0.00008485765,0.00006834589,0.00001303874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004495443,"about_ca_system_score_gemma":0.0001897131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001632954,"about_ca_topic_score_gemma":0.000001420579,"domain_scores_codex":[0.9984285,0.0000386199,0.0005053835,0.0003706519,0.0004295373,0.0002273473],"domain_scores_gemma":[0.998251,0.0006787683,0.0002304363,0.0002157047,0.0005571864,0.00006690063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001712952,0.0001636651,0.0002572167,0.00002128182,0.00002910786,0.000001276697,0.00004791463,0.7793611,0.0004817012,0.2032616,0.002654272,0.01370369],"study_design_scores_gemma":[0.001068298,0.0001225978,0.01849381,0.0000118331,0.00001386648,0.00001860252,0.00001148998,0.9162228,0.00162009,0.05937446,0.002836049,0.000206087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05739261,0.0002924067,0.9404699,0.000501849,0.0003952438,0.0003268718,0.00006505824,0.00009637363,0.0004597418],"genre_scores_gemma":[0.6237913,8.804552e-7,0.3752201,0.00009408234,0.0001911933,0.00003193385,0.0003086138,0.000008112475,0.0003536706],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5663987,"threshold_uncertainty_score":0.6875617,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0264883566089385,"score_gpt":0.2731884271811129,"score_spread":0.2467000705721744,"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."}}