{"id":"W2022832678","doi":"10.1016/s0925-7721(01)00058-x","title":"Optimally computing a shortest weakly visible line segment inside a simple polygon","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor; Simon Fraser University","funders":"","keywords":"Simple polygon; Polygon covering; Polygon (computer graphics); Visibility polygon; Star-shaped polygon; Point in polygon; Rectilinear polygon; Algorithm; Line segment; Mathematics; Line (geometry); Combinatorics; Vertex (graph theory); Simple (philosophy); Computer science; Monotone polygon; Regular polygon; Geometry; Graph","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.0003308182,0.0009649121,0.001464848,0.0007864921,0.000800717,0.001271031,0.001382779,0.001751921,0.005904978],"category_scores_gemma":[0.002185188,0.0008701917,0.0008707573,0.001028799,0.0008350461,0.001385476,0.001321151,0.001280558,0.0009027937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000772525,"about_ca_system_score_gemma":0.00112066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004568132,"about_ca_topic_score_gemma":0.007244864,"domain_scores_codex":[0.9997094,0.00004902752,0.00001347794,0.00008956918,0.00008006671,0.00005843388],"domain_scores_gemma":[0.9990356,0.0005786626,0.00008698937,0.0001021904,0.00009981936,0.0000968531],"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.001373111,0.0002703409,0.002458555,0.0003983511,0.00008325744,0.0004153708,0.0004450937,0.7621461,0.0409858,0.01455578,0.005137322,0.171731],"study_design_scores_gemma":[0.00004416144,0.0001118858,0.0001818945,0.000007682499,0.00001234672,0.00002920469,0.00009119492,0.9881196,0.005375138,0.005434458,0.0005846494,0.00000776667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2992872,0.0001170999,0.6913754,0.0003403438,0.00005457531,0.0001479361,0.0003549358,0.001946784,0.00637568],"genre_scores_gemma":[0.5327167,0.00007009148,0.4624828,0.00004865506,0.00002423235,0.00006745648,0.0007195255,0.0005068659,0.003363687],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005904978,"threshold_uncertainty_score":0.01975411,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02784048829496428,"score_gpt":0.2623624506723088,"score_spread":0.2345219623773446,"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."}}