{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002496057,0.0001462988,0.00013872,0.0003115142,0.0002069983,0.0003751116,0.0008393997,0.00003402507,0.00002536678],"category_scores_gemma":[0.00001945817,0.0001491448,0.00006660479,0.00108018,0.00004403972,0.0004205618,0.0004662196,0.0001045702,0.0002553859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003477187,"about_ca_system_score_gemma":0.0000338093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002574791,"about_ca_topic_score_gemma":0.000001175384,"domain_scores_codex":[0.9985044,0.00002937962,0.0002775588,0.0004262403,0.0004608551,0.0003015749],"domain_scores_gemma":[0.9992679,0.0001681807,0.00009019071,0.0003191735,0.00009741737,0.0000571488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001638153,0.0003980896,0.01472358,0.00003027387,0.00003294536,0.00009175216,0.00005852698,0.2636639,0.00003012841,0.5670143,0.01557454,0.1383803],"study_design_scores_gemma":[0.0003318039,0.00003421076,0.1513674,0.0000146366,0.000005226773,0.00001405444,0.000007586238,0.8223784,0.00002841578,0.01721735,0.008357731,0.0002432097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06947318,0.0001123781,0.9242555,0.0003105964,0.0005319407,0.0001220614,0.000008995961,0.000278153,0.00490719],"genre_scores_gemma":[0.8793063,6.399004e-7,0.1194939,0.0003043536,0.0002527004,0.000002724661,0.0001492932,0.000008341449,0.0004818241],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.809833,"threshold_uncertainty_score":0.608195,"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."}}