{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009449499,0.001590325,0.002020685,0.002004381,0.0008066861,0.002079782,0.003082536,0.001985504,0.00667862],"category_scores_gemma":[0.005954957,0.001319511,0.001396018,0.003393476,0.001236781,0.002675463,0.002726473,0.002001479,0.001250247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001245582,"about_ca_system_score_gemma":0.0009884151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003208229,"about_ca_topic_score_gemma":0.003424356,"domain_scores_codex":[0.9991989,0.0001302557,0.00004943468,0.0001631503,0.0003633224,0.00009503917],"domain_scores_gemma":[0.998178,0.001140887,0.0001819184,0.0002194267,0.0002056997,0.00007399979],"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.0005516256,0.0002327577,0.001877237,0.0005046545,0.00009072215,0.0001864032,0.0004638259,0.5288538,0.005110227,0.03898677,0.007297061,0.4158448],"study_design_scores_gemma":[0.00006277757,0.00006407181,0.0001601235,0.00003236845,0.00002433325,0.000121894,0.00008916265,0.9807547,0.001552182,0.01544093,0.001686942,0.00001053673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02178117,0.0002517199,0.9734109,0.0001222027,0.0000339209,0.0001120452,0.0001543223,0.0007413632,0.003392281],"genre_scores_gemma":[0.09129924,0.0002168875,0.9055457,0.00003516618,0.00002395835,0.0001739217,0.0005460617,0.0002278,0.00193147],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00667862,"threshold_uncertainty_score":0.02234221,"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."}}