{"id":"W3215715196","doi":"10.1007/978-3-030-96731-4_33","title":"On Approximating Shortest Paths in Weighted Triangular Tessellations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Agencia Estatal de Investigación; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Universidad de Alcalá","keywords":"Combinatorics; Tessellation (computer graphics); Shortest path problem; Vertex (graph theory); Hexagonal tiling; Mathematics; Path (computing); Space (punctuation); Geometry; Grid; Computer science; Graph","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.001064547,0.001614861,0.00175236,0.001791661,0.0006202393,0.001658744,0.00256449,0.001332615,0.006536725],"category_scores_gemma":[0.008307391,0.001040293,0.00100527,0.003255205,0.001089103,0.002737049,0.002985635,0.002088865,0.0009485111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001505538,"about_ca_system_score_gemma":0.0006363765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009208396,"about_ca_topic_score_gemma":0.01129738,"domain_scores_codex":[0.9993106,0.000206481,0.00003773522,0.0001033459,0.0002678561,0.00007398766],"domain_scores_gemma":[0.996744,0.002414721,0.0001541765,0.0002457628,0.0003124165,0.000128867],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000215194,0.00009865643,0.0009497455,0.0003113279,0.00005524279,0.0000832759,0.0002752141,0.7699208,0.003732051,0.0671472,0.005781855,0.1514295],"study_design_scores_gemma":[0.00001044809,0.00003365896,0.00009865117,0.00002403839,0.00000961208,0.00003520674,0.00006359546,0.965967,0.0006527954,0.03123077,0.001867266,0.00000695788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04265261,0.0006617079,0.9476447,0.0001595285,0.0001123541,0.0001008962,0.0002753405,0.0005032675,0.007889586],"genre_scores_gemma":[0.2252278,0.001351486,0.7594041,0.0001587411,0.00009172136,0.0002413181,0.001110743,0.0007414097,0.01167255],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009208396,"threshold_uncertainty_score":0.02186751,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01708299613129252,"score_gpt":0.2438070071282417,"score_spread":0.2267240109969492,"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."}}