{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169485,0.001275658,0.001544653,0.002026392,0.0009380329,0.001657152,0.002140106,0.001513131,0.01161284],"category_scores_gemma":[0.00761618,0.001426876,0.001389059,0.002229233,0.00109338,0.002338785,0.00406247,0.002206969,0.0020525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009239963,"about_ca_system_score_gemma":0.0008221862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002444656,"about_ca_topic_score_gemma":0.003974793,"domain_scores_codex":[0.9990444,0.0001882951,0.00005538956,0.0001645217,0.0004497725,0.00009759664],"domain_scores_gemma":[0.9977729,0.001409648,0.0001401142,0.0002401805,0.0003479641,0.00008921886],"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.0002962771,0.0001032527,0.0008311121,0.0004225757,0.00007669722,0.0001375893,0.0005274669,0.4656378,0.007032828,0.0934037,0.01013552,0.4213951],"study_design_scores_gemma":[0.00007000702,0.00004593362,0.0001309056,0.00003201126,0.00001998563,0.00006490455,0.0000938928,0.9289917,0.001828327,0.06477725,0.003931445,0.00001377687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006337276,0.0001599656,0.9902783,0.00008842441,0.0000430148,0.00007618721,0.00007883312,0.0005698045,0.002368153],"genre_scores_gemma":[0.09470711,0.0002882216,0.9013457,0.00005842033,0.00006048924,0.0002596488,0.000331536,0.0005672321,0.002381528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01161284,"threshold_uncertainty_score":0.03884882,"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."}}