{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006591119,0.001122458,0.001217999,0.001351225,0.001379477,0.001488094,0.002248787,0.001170778,0.01351559],"category_scores_gemma":[0.002328908,0.001068779,0.001173082,0.00184098,0.0008490943,0.002032833,0.002957008,0.001873224,0.003442356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001003182,"about_ca_system_score_gemma":0.00155633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003029341,"about_ca_topic_score_gemma":0.00537107,"domain_scores_codex":[0.999201,0.0001044712,0.00004711553,0.0001686583,0.000373584,0.0001051668],"domain_scores_gemma":[0.9992959,0.0002312102,0.00006275035,0.0001369515,0.0002220983,0.00005105374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003074185,0.0001067336,0.0007690645,0.0003251673,0.00005734611,0.0002340608,0.0003764354,0.1680429,0.01325194,0.0681024,0.02605216,0.7223743],"study_design_scores_gemma":[0.0001459668,0.0001162553,0.0003398915,0.00006115263,0.00003185599,0.0004095521,0.0002073309,0.8769741,0.01087614,0.06720507,0.04358085,0.0000518397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001702228,0.00006073121,0.9948447,0.00009044343,0.00002919272,0.00007147523,0.00008142862,0.0009039065,0.002215902],"genre_scores_gemma":[0.02659741,0.00009239968,0.9701522,0.00003768292,0.00002069224,0.0001798222,0.0003516673,0.0002920606,0.002276036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01351559,"threshold_uncertainty_score":0.04521418,"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."}}