{"id":"W2951594256","doi":"10.1016/j.comgeo.2019.101595","title":"Self-approaching paths in simple polygons","year":2019,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Fonds De La Recherche Scientifique - FNRS","keywords":"Polygon (computer graphics); Simple polygon; Mathematics; Shortest path problem; Path (computing); Point in polygon; Point (geometry); Polygon covering; Rectilinear polygon; Simple (philosophy); Position (finance); Equiangular polygon; Combinatorics; Monotone polygon; Computer science; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085157,0.0004726311,0.0005394567,0.001645091,0.0001579344,0.0005141945,0.001502688,0.0003660138,0.00003270768],"category_scores_gemma":[0.0001307695,0.0005414742,0.0002403763,0.001727685,0.00002362931,0.000499514,0.002144829,0.001037077,0.0002434614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004563249,"about_ca_system_score_gemma":0.0009522631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004372592,"about_ca_topic_score_gemma":0.000007817926,"domain_scores_codex":[0.9962197,0.0002430279,0.0007963981,0.001274333,0.0009510793,0.0005154547],"domain_scores_gemma":[0.9977062,0.0006701771,0.0003804187,0.0007947414,0.0002854902,0.0001630264],"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.000005159585,0.0002426038,0.002207927,0.0001878571,0.00005745149,0.00001927129,0.0004089461,0.9523929,0.000007490885,0.03188704,0.0009490259,0.01163437],"study_design_scores_gemma":[0.0004853445,0.00004061737,0.02130674,0.0000616797,0.00001144163,0.0000242982,0.00001680843,0.8752946,0.00002473506,0.09958804,0.002598366,0.0005473804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0878116,0.001009141,0.9055868,0.0007746062,0.001766798,0.0006807751,0.00004867987,0.0003919273,0.001929619],"genre_scores_gemma":[0.7735695,0.00002335181,0.2245697,0.0005455381,0.0002989722,0.00005649465,0.0007190558,0.00002954819,0.0001878789],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6857579,"threshold_uncertainty_score":0.9997037,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02020144042209517,"score_gpt":0.2662651562604912,"score_spread":0.2460637158383961,"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."}}