{"id":"W2757636421","doi":"10.1007/s00453-020-00673-y","title":"Shortest Paths in the Plane with Obstacle Violations","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Obstacle; Shortest path problem; Combinatorics; Euclidean shortest path; Mathematics; Plane (geometry); K shortest path routing; Regular polygon; Path (computing); Point (geometry); Yen's algorithm; Distance; Computer science; Dijkstra's algorithm; Graph; 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":[],"consensus_categories":[],"category_scores_codex":[0.00009036336,0.00006139229,0.00005779614,0.00003455886,0.00007683117,0.00008429721,0.0003407412,0.00001774483,0.000008667404],"category_scores_gemma":[0.00002028813,0.00004206085,0.00001482511,0.0006314756,0.00001298702,0.0001984094,0.0000368918,0.00009181101,0.00003451827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008562993,"about_ca_system_score_gemma":0.00004578992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009296307,"about_ca_topic_score_gemma":0.00001121068,"domain_scores_codex":[0.9993786,0.00004201937,0.0001028185,0.0001821388,0.0001871482,0.0001072905],"domain_scores_gemma":[0.999631,0.0001214425,0.00002538485,0.0001492747,0.00003167386,0.00004125251],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003719415,0.000420073,0.004957771,0.00001905835,0.00005292605,0.0003076804,0.0175434,0.06180703,0.001778241,0.1716783,0.009202328,0.732196],"study_design_scores_gemma":[0.0004759553,0.0002899913,0.03354503,0.000009369372,0.000006737781,0.00006616448,0.0001696426,0.941046,0.0007791538,0.002447997,0.02094643,0.0002175558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03917294,0.00006654426,0.9480826,0.01125785,0.00007151786,0.0001716608,0.000005240112,0.00006703101,0.001104584],"genre_scores_gemma":[0.9629238,0.000001945473,0.03491117,0.001988292,0.0001214209,0.00001368122,0.00002057756,0.000002876227,0.00001627026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9237508,"threshold_uncertainty_score":0.1715192,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01858256325874083,"score_gpt":0.2171970148391594,"score_spread":0.1986144515804186,"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."}}