{"id":"W2124089227","doi":"","title":"An Algorithm for the MaxMin Area Triangulation of a Convex Polygon","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Minimum-weight triangulation; Polygon (computer graphics); Convex polygon; Triangulation; Point set triangulation; Mathematics; Pitteway triangulation; Star-shaped polygon; Polygon covering; Combinatorics; Regular polygon; Diagonal; Rectilinear polygon; Algorithm; Computer science; Delaunay triangulation; Simple polygon; Convex optimization; Convex set; Bowyer–Watson algorithm; 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.0005936774,0.0001761176,0.0002019464,0.0006121481,0.000319378,0.000179039,0.0005357604,0.00009006261,0.0001277877],"category_scores_gemma":[0.0001702327,0.0001569545,0.00009166801,0.0009803033,0.00006879411,0.0003114344,0.00001365036,0.000113708,0.0000166037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001143692,"about_ca_system_score_gemma":0.001457624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007052447,"about_ca_topic_score_gemma":0.0008431614,"domain_scores_codex":[0.9984418,0.0001157538,0.000348642,0.0004006745,0.0003912609,0.0003018853],"domain_scores_gemma":[0.9978361,0.0007032011,0.0001660756,0.0003595334,0.0006536739,0.0002814661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000766123,0.00005921456,0.0000828111,0.000007558372,0.00003680588,0.000002277746,0.0001601474,0.1068914,0.00009384393,0.6473929,0.0006850552,0.2445804],"study_design_scores_gemma":[0.0005914993,0.0002267248,0.004506867,0.00001370184,0.00001156353,0.00001432976,0.00007591993,0.9496232,0.0006027039,0.03983604,0.004289257,0.0002081775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006880086,0.0001173666,0.9898056,0.001076807,0.0005526353,0.0004698382,0.0001018038,0.00003456275,0.000961301],"genre_scores_gemma":[0.9013334,0.000003934347,0.09735283,0.000834426,0.00007874179,0.00004776026,0.0001502274,0.00001019194,0.000188496],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8944533,"threshold_uncertainty_score":0.640042,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0404761246826628,"score_gpt":0.2720561725661819,"score_spread":0.2315800478835191,"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."}}