{"id":"W1534329287","doi":"10.1007/978-3-540-77120-3_58","title":"An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Plane (geometry); Path (computing); Algorithm; Combinatorics; Computer science; Mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006146251,0.001591565,0.001418892,0.00157909,0.0009961445,0.001969099,0.002894073,0.001401175,0.01168878],"category_scores_gemma":[0.003552364,0.0007284394,0.001055142,0.002971601,0.0008746081,0.003594301,0.002619677,0.001614818,0.00231638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001667598,"about_ca_system_score_gemma":0.001476512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005256973,"about_ca_topic_score_gemma":0.009031394,"domain_scores_codex":[0.999351,0.00008581413,0.00005122471,0.000182885,0.0002241613,0.0001049158],"domain_scores_gemma":[0.9986542,0.0007694869,0.0001005286,0.0002487902,0.0001341293,0.00009282381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007261904,0.0002302584,0.001010398,0.0008934365,0.00009307796,0.0001386781,0.0003414939,0.1054153,0.01095519,0.03223174,0.02904273,0.8189215],"study_design_scores_gemma":[0.0004769138,0.0002940714,0.0009236627,0.00009827875,0.00009082315,0.0003565575,0.0002733396,0.8512273,0.008303097,0.118084,0.01981862,0.00005332124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03622855,0.001056909,0.9430259,0.0005859461,0.0001656507,0.000331456,0.0009391007,0.004902757,0.01276372],"genre_scores_gemma":[0.0685985,0.0003460495,0.925154,0.00009322462,0.00004142416,0.0002759584,0.001300321,0.0002863948,0.003904127],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01168878,"threshold_uncertainty_score":0.03910285,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02434634861827658,"score_gpt":0.278317481065577,"score_spread":0.2539711324473005,"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."}}