{"id":"W2060313721","doi":"10.1016/j.ipl.2007.08.008","title":"Flying over a polyhedral terrain","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Terrain; Approximation algorithm; Shortest path problem; Combinatorics; Metric (unit); Mathematics; Obstacle; Euclidean shortest path; Euclidean space; Computational geometry; Euclidean geometry; Path (computing); Space (punctuation); Euclidean distance; Metric space; Algorithm; Computer science; Discrete mathematics; K shortest path routing; Graph; Geometry; Geography","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.00009934571,0.0002367201,0.0003767539,0.0003207001,0.0007252541,0.0005349536,0.0005394997,0.0006724125,0.002356386],"category_scores_gemma":[0.0005364637,0.0002275839,0.0003316525,0.0004318357,0.0004502652,0.00053924,0.0007528455,0.0004941315,0.0002051465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003053146,"about_ca_system_score_gemma":0.0003438583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007903563,"about_ca_topic_score_gemma":0.00576585,"domain_scores_codex":[0.9999079,0.00001312512,0.000002799839,0.00002047267,0.00003454099,0.00002120103],"domain_scores_gemma":[0.9998351,0.0000638194,0.0000166514,0.00003058309,0.00002032102,0.00003351449],"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.0002963747,0.00007793074,0.002786421,0.00008293059,0.00009597573,0.0009012505,0.0002075127,0.9182751,0.0278822,0.0134149,0.00249556,0.03348381],"study_design_scores_gemma":[0.00001577052,0.00005229126,0.0008269187,0.000004698105,0.000007534219,0.00008298132,0.00007842545,0.993835,0.0009832634,0.003568506,0.0005373386,0.00000733862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7022244,0.0002678779,0.279851,0.0006782847,0.0001978412,0.00008495706,0.0004825408,0.0005041315,0.01570897],"genre_scores_gemma":[0.9458067,0.0001628146,0.05060913,0.0000550638,0.00003026383,0.00001747602,0.0002954765,0.00004234122,0.002980859],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007903563,"threshold_uncertainty_score":0.01571512,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007763657452015505,"score_gpt":0.2452831917936056,"score_spread":0.2375195343415901,"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."}}