{"id":"W2007853611","doi":"10.1016/j.comgeo.2006.03.003","title":"Computing homotopic shortest paths efficiently","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Randomized algorithm; Mathematics; Deterministic algorithm; Combinatorics; Floyd–Warshall algorithm; Point (geometry); Plane (geometry); Running time; Shortest path problem; Algorithm; Discrete mathematics; Computer science; K shortest path routing; 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.0004120437,0.0009151502,0.001372086,0.001828408,0.0009576128,0.001810755,0.001525642,0.0007406708,0.01590632],"category_scores_gemma":[0.003030335,0.0005464934,0.0007415087,0.003014886,0.0005882333,0.003632856,0.002440417,0.001181318,0.002347326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009719942,"about_ca_system_score_gemma":0.001302001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00359292,"about_ca_topic_score_gemma":0.007664877,"domain_scores_codex":[0.9993535,0.00006979225,0.00004417588,0.000186286,0.000242242,0.0001040709],"domain_scores_gemma":[0.9989881,0.0004252638,0.00006526391,0.0003192009,0.000134507,0.00006766798],"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.0007890098,0.0003036529,0.002318437,0.0004979083,0.0001418601,0.0004152216,0.0004558895,0.2853689,0.01752044,0.1046818,0.02090561,0.5666012],"study_design_scores_gemma":[0.0001079128,0.0001305046,0.0009773792,0.00003715684,0.00005627723,0.0002457819,0.0004165431,0.766458,0.01072985,0.2102156,0.01060006,0.00002485317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1734537,0.000388098,0.8025702,0.0004358157,0.0001336226,0.00020708,0.00137776,0.003746601,0.0176871],"genre_scores_gemma":[0.4353046,0.0004140315,0.5495431,0.00008912803,0.00005298135,0.00014378,0.003189372,0.0006463335,0.01061663],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01590632,"threshold_uncertainty_score":0.05321187,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008324284205473856,"score_gpt":0.2260742693166069,"score_spread":0.217749985111133,"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."}}