{"id":"W2025130628","doi":"10.1007/s00453-001-0027-5","title":"Approximating Shortest Paths on Weighted Polyhedral Surfaces","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polyhedron; Shortest path problem; Combinatorics; Dijkstra's algorithm; Mathematics; Regular polygon; Bounded function; Theory of computation; Context (archaeology); Domain (mathematical analysis); Euclidean shortest path; Computational geometry; Face (sociological concept); Discrete mathematics; K shortest path routing; Graph; Algorithm; 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.0009786889,0.001297727,0.001522243,0.00234676,0.0005548915,0.001428924,0.002264473,0.001498418,0.003810996],"category_scores_gemma":[0.00845504,0.001167599,0.00087349,0.002318639,0.001220763,0.002512687,0.002684996,0.001740732,0.000605507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001222643,"about_ca_system_score_gemma":0.0006037197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00340938,"about_ca_topic_score_gemma":0.004417602,"domain_scores_codex":[0.9991732,0.0002259294,0.00004598249,0.0001449886,0.0003331975,0.00007671124],"domain_scores_gemma":[0.9973772,0.001802709,0.0001838333,0.0002296628,0.0002762574,0.0001303428],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001928167,0.00007483859,0.0008456463,0.0001816019,0.0000470913,0.00008336914,0.0001551646,0.8583431,0.003026154,0.0640232,0.001927938,0.07109897],"study_design_scores_gemma":[0.00001251496,0.00002507787,0.00007640659,0.00001162081,0.000006438797,0.00001748987,0.00002962861,0.9541941,0.0006074852,0.04432814,0.0006868483,0.000004250642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09763142,0.0003074222,0.8983423,0.0001408929,0.00005973483,0.00008650625,0.0001671436,0.000397667,0.002866989],"genre_scores_gemma":[0.4373332,0.0005905274,0.5538583,0.00006372644,0.00004662112,0.0002995261,0.000744506,0.0004661541,0.006597454],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003810996,"threshold_uncertainty_score":0.01274908,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01470809025050108,"score_gpt":0.2418008765560288,"score_spread":0.2270927863055277,"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."}}