{"id":"W1525225516","doi":"10.1007/978-3-642-03367-4_32","title":"Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Perimeter; Polygon (computer graphics); Computer science; Algorithm; Set (abstract data type); Line (geometry); Rectilinear polygon; Simple polygon; Mathematics; Monotone polygon; Geometry; Programming language; Telecommunications","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000943445,0.0003647261,0.0004330561,0.001089386,0.0001939559,0.000266883,0.001202862,0.0002085168,0.000007589324],"category_scores_gemma":[0.0001289435,0.0003588531,0.0001636244,0.0006059526,0.0001500325,0.0005678923,0.0004074537,0.0003077197,0.000004711279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000211801,"about_ca_system_score_gemma":0.0002944832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005574047,"about_ca_topic_score_gemma":0.00000761343,"domain_scores_codex":[0.9972474,0.00002905316,0.0006374973,0.001008847,0.0006737947,0.0004034358],"domain_scores_gemma":[0.9981126,0.0004433025,0.0004761427,0.0005268059,0.0003512526,0.00008994629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001285754,0.00002559413,0.000004071533,0.00006079023,0.00001336737,0.000004120731,0.00129743,0.05293344,0.00219925,0.002529927,0.00000845132,0.9409107],"study_design_scores_gemma":[0.0003844041,0.0004554699,0.00002436304,0.0003268907,0.00001022033,0.00003066931,6.531511e-7,0.9324526,0.01806082,0.04768486,0.000208417,0.000360639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008563533,0.0001799765,0.9964688,0.0003288088,0.001215229,0.0006010983,0.00001253174,0.00006445439,0.0002727841],"genre_scores_gemma":[0.1964335,0.000006954825,0.8021956,0.0004332992,0.0006074497,0.00001403696,0.00004165584,0.00001892572,0.0002485954],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9405501,"threshold_uncertainty_score":0.9998863,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04272748183183005,"score_gpt":0.2994706362007461,"score_spread":0.256743154368916,"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."}}