{"id":"W2100967180","doi":"10.1016/j.jda.2003.12.004","title":"Optimizing a constrained convex polygonal annulus","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polygon (computer graphics); Star-shaped polygon; Polygon covering; Convex polygon; Rectilinear polygon; Regular polygon; Annulus (botany); Mathematics; Point in polygon; Combinatorics; Mathematical optimization; Algorithm; Computer science; Convex set; Geometry; Simple polygon; Convex optimization","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.0009104277,0.0008077864,0.001618665,0.0006501842,0.0004908855,0.001265693,0.00148954,0.002630334,0.005361234],"category_scores_gemma":[0.004455472,0.0007979684,0.0006015822,0.0005785597,0.0009728678,0.001090521,0.002020363,0.001096361,0.0006279076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007746418,"about_ca_system_score_gemma":0.0007180893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002169417,"about_ca_topic_score_gemma":0.001649608,"domain_scores_codex":[0.9996188,0.0001197853,0.00001668031,0.0001071428,0.00009775684,0.00003987703],"domain_scores_gemma":[0.9989863,0.0006824279,0.00006153671,0.0000819238,0.0001118993,0.00007585151],"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.00009697866,0.00004236179,0.0002612986,0.00009323714,0.00001649828,0.0001088754,0.00003997601,0.9578908,0.002295224,0.01632427,0.001876111,0.02095435],"study_design_scores_gemma":[0.000009856253,0.00002194774,0.00003094714,0.000005764205,0.000003837859,0.0000184065,0.000005212653,0.9961513,0.0003068124,0.002877637,0.0005652678,0.000003022563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04700812,0.0003978353,0.938763,0.0005843039,0.0001745364,0.00008717048,0.0001800142,0.0003847441,0.01242024],"genre_scores_gemma":[0.566488,0.0002845243,0.4237801,0.0002189831,0.0001199987,0.0001744747,0.0002530497,0.0004917324,0.008189118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005361234,"threshold_uncertainty_score":0.0179351,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01249269046030971,"score_gpt":0.2567539926501066,"score_spread":0.2442613021897969,"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."}}