{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008739367,0.0006550964,0.0008780901,0.0008530307,0.0009531421,0.001486026,0.001458835,0.001610599,0.004481323],"category_scores_gemma":[0.01119578,0.0006477149,0.0006605016,0.001432753,0.0008715936,0.001883478,0.002496572,0.001979345,0.0004686376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006777062,"about_ca_system_score_gemma":0.001095956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003204353,"about_ca_topic_score_gemma":0.003114201,"domain_scores_codex":[0.9991747,0.000284,0.00004065691,0.0001182832,0.0002499198,0.0001325787],"domain_scores_gemma":[0.9962991,0.002527036,0.0004063878,0.0002645506,0.0003123953,0.0001905468],"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.0003621223,0.00009743379,0.001780543,0.0002353873,0.00007720956,0.0005076352,0.0002374099,0.6743915,0.001803266,0.2604557,0.007125983,0.05292574],"study_design_scores_gemma":[0.00005044293,0.00004533086,0.0003417934,0.00003041014,0.00001734397,0.0001512184,0.0001032477,0.731882,0.0007822908,0.2635352,0.003047784,0.00001292647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1844818,0.0006914751,0.7945373,0.001024427,0.0001622436,0.0001385707,0.0005688266,0.00031991,0.0180754],"genre_scores_gemma":[0.7254137,0.0005804385,0.2590516,0.0001703257,0.00008069415,0.0002012247,0.0009317182,0.0003321162,0.01323821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004481323,"threshold_uncertainty_score":0.01499152,"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."}}