{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002245103,0.0003984061,0.0003025549,0.001244342,0.0007541979,0.001351043,0.0006462427,0.0007109518,0.005458156],"category_scores_gemma":[0.002472289,0.000421519,0.0004011141,0.0008079915,0.0009225673,0.001275615,0.001396025,0.0009175898,0.0006836519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005367678,"about_ca_system_score_gemma":0.0003857308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001335855,"about_ca_topic_score_gemma":0.001237911,"domain_scores_codex":[0.9997697,0.0000470273,0.00001031383,0.00004331631,0.00009652082,0.00003298683],"domain_scores_gemma":[0.9994944,0.0002236504,0.00007605216,0.00004976836,0.0000802643,0.00007579165],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001668344,0.00008836509,0.001879049,0.0001712984,0.00002044639,0.0004716512,0.0006093683,0.1366844,0.005331921,0.8055777,0.00278827,0.04621077],"study_design_scores_gemma":[0.00003327505,0.00007745245,0.0006470894,0.00005063069,0.00001244112,0.0003166329,0.0003233156,0.3662847,0.00304694,0.6161013,0.01308705,0.00001910683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5143856,0.0004066822,0.4404887,0.000289477,0.0001709192,0.0001312454,0.0004068568,0.0004955502,0.04322497],"genre_scores_gemma":[0.8355811,0.0005885307,0.130393,0.000077344,0.00004872539,0.0000983972,0.0006677597,0.000353991,0.03219118],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005458156,"threshold_uncertainty_score":0.01825935,"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."}}