{"id":"W2010369728","doi":"10.1007/s00453-004-1101-6","title":"A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Triangulation; Theory of computation; Polygon (computer graphics); Mathematics; Regular polygon; Minimum-weight triangulation; Convex polygon; Scheme (mathematics); Polygon covering; Delaunay triangulation; Combinatorics; Approximation algorithm; Convex combination; Algorithm; Mathematical optimization; Convex optimization; Computer science; Bowyer–Watson algorithm; Geometry; Mathematical analysis","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.0007678113,0.0007515365,0.001123046,0.001005936,0.0006557191,0.001392206,0.002603705,0.001334543,0.006165272],"category_scores_gemma":[0.004008001,0.0006015366,0.0007895002,0.002002421,0.0007855424,0.001954612,0.002760504,0.00163675,0.001193645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001130526,"about_ca_system_score_gemma":0.0009094281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005315394,"about_ca_topic_score_gemma":0.007463755,"domain_scores_codex":[0.9993615,0.0001155323,0.00003726115,0.00008291967,0.0003050108,0.00009785581],"domain_scores_gemma":[0.9990495,0.0004012347,0.00007606036,0.0002308399,0.0001650588,0.00007720938],"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.0008106515,0.0001689985,0.0007211955,0.0003021408,0.00005507879,0.0001370746,0.0002909345,0.5170786,0.01621835,0.06150607,0.007617738,0.3950931],"study_design_scores_gemma":[0.00004034442,0.00002987742,0.00004759972,0.000008118578,0.000006867122,0.00001940245,0.00002054203,0.985135,0.00148638,0.01190952,0.001290488,0.000005856348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01630768,0.0001197374,0.9803789,0.0001134124,0.00005559281,0.00005559377,0.00007797706,0.0006350043,0.002256109],"genre_scores_gemma":[0.2070673,0.0001852711,0.7872967,0.00006779293,0.00005013623,0.0001717871,0.0003657792,0.0002439225,0.004551406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006165272,"threshold_uncertainty_score":0.02062488,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01231174919954155,"score_gpt":0.2467655707140297,"score_spread":0.2344538215144882,"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."}}