{"id":"W2074682596","doi":"10.1007/s00454-009-9204-0","title":"Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Mathematics; Shortest path problem; Combinatorics; Logarithm; Euclidean geometry; Data structure; Graph; Range (aeronautics); Discrete mathematics; Algorithm; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.00199828,0.001792954,0.00344438,0.002384674,0.001600682,0.004326002,0.005469124,0.002596575,0.009905683],"category_scores_gemma":[0.01429492,0.001325761,0.001733094,0.006716004,0.001535075,0.01048468,0.006655388,0.002897348,0.002080685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002566333,"about_ca_system_score_gemma":0.002079603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00740019,"about_ca_topic_score_gemma":0.009669504,"domain_scores_codex":[0.9960044,0.0005421607,0.0003093841,0.0008041966,0.001848842,0.0004910656],"domain_scores_gemma":[0.9927349,0.004072795,0.0003502674,0.001787909,0.0007964423,0.0002575965],"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.001402192,0.0004135954,0.002035471,0.0008027637,0.0001958365,0.0001950951,0.0006768399,0.4710714,0.008081797,0.09406059,0.02237766,0.3986867],"study_design_scores_gemma":[0.0000951379,0.00005443304,0.0001465032,0.0000180736,0.0000254995,0.00006090928,0.0001772288,0.9195784,0.001814001,0.07576524,0.002248283,0.00001636872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04740949,0.0007892401,0.9415538,0.0006389632,0.0001211921,0.0003180229,0.00101797,0.004052598,0.004098753],"genre_scores_gemma":[0.3187869,0.000633685,0.6693311,0.0002118857,0.0001112023,0.0005592968,0.004171025,0.0009994534,0.005195422],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009905683,"threshold_uncertainty_score":0.03313786,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01929003721726897,"score_gpt":0.2807975083370942,"score_spread":0.2615074711198252,"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."}}