{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004778387,0.0003539684,0.0003442209,0.0008178637,0.0004828541,0.000451868,0.0008156168,0.0001137641,0.0002590907],"category_scores_gemma":[0.0001512815,0.0003846719,0.0001730559,0.002531522,0.00006283766,0.0007707928,0.0004939723,0.0002921843,0.0004866245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001522774,"about_ca_system_score_gemma":0.0001218837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001546675,"about_ca_topic_score_gemma":0.000003499933,"domain_scores_codex":[0.9968133,0.0001138643,0.0007107995,0.0008323641,0.0009732374,0.0005564597],"domain_scores_gemma":[0.9979672,0.0005882878,0.0002475933,0.0004606175,0.0004527705,0.0002835476],"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.000006649629,0.0003347887,0.0005761496,0.00002045972,0.00005916132,0.0000339665,0.0002701046,0.8881962,0.0004707191,0.03250737,0.004483858,0.07304058],"study_design_scores_gemma":[0.0005954227,0.0002240918,0.008486535,0.00002848705,0.00001266638,0.0001248394,0.00002170742,0.9740917,0.0004539708,0.01160281,0.003916633,0.0004410967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09229874,0.0008040998,0.9020555,0.001434824,0.0005209087,0.0002901673,0.00001477911,0.0003948634,0.002186126],"genre_scores_gemma":[0.7522488,0.00001152949,0.2454679,0.001371406,0.0003712027,0.00001111367,0.0001270708,0.00002132635,0.0003696898],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.65995,"threshold_uncertainty_score":0.9998605,"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."}}