{"id":"W2129446687","doi":"","title":"Optimal Polygon Placement","year":2006,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba; Carleton University","funders":"","keywords":"Simple polygon; Combinatorics; Polygon (computer graphics); Mathematics; Set (abstract data type); Algorithm; Polygon covering; Plane (geometry); Annulus (botany); Time complexity; Space (punctuation); Computer science; Monotone polygon; 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.0003218051,0.000882228,0.001075098,0.0008484065,0.0007762146,0.000898232,0.00116667,0.001320987,0.007870505],"category_scores_gemma":[0.002220867,0.0006226075,0.0006785279,0.0009170985,0.0007000637,0.001255671,0.001653897,0.0004373832,0.001983051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005264608,"about_ca_system_score_gemma":0.0007608352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001260096,"about_ca_topic_score_gemma":0.001619567,"domain_scores_codex":[0.9993392,0.0001072924,0.00004514574,0.0001726746,0.0002185527,0.0001170778],"domain_scores_gemma":[0.9995314,0.0001579984,0.00008148589,0.0001330521,0.00004896673,0.00004715961],"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.0005415308,0.0001920964,0.001391437,0.000490584,0.00004310875,0.0005715981,0.0003125305,0.5499023,0.02840366,0.04876564,0.01203494,0.3573506],"study_design_scores_gemma":[0.0001017343,0.0002612,0.0006196857,0.0000449803,0.00002530767,0.0004560121,0.0002375162,0.918162,0.01323969,0.04879136,0.01802974,0.00003083457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05377501,0.0005034014,0.9229009,0.0003477896,0.000109424,0.0002176513,0.0003842165,0.001451889,0.02030971],"genre_scores_gemma":[0.3733729,0.0006657802,0.6157194,0.0000668897,0.00006129685,0.0001710483,0.0008357845,0.0002468267,0.00886012],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007870505,"threshold_uncertainty_score":0.02632946,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008290254393005757,"score_gpt":0.2236949507138582,"score_spread":0.2154046963208525,"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."}}