{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004834419,0.00008688417,0.00006098131,0.0002988398,0.0003031385,0.0004212045,0.0002474562,0.00003270383,0.000008081775],"category_scores_gemma":[0.00003537732,0.00008619382,0.00003053675,0.0005269408,0.00001799247,0.00473308,0.00005447781,0.00008559851,0.00005546576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005592063,"about_ca_system_score_gemma":0.00005087287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007440494,"about_ca_topic_score_gemma":0.000001358571,"domain_scores_codex":[0.9990669,0.00001078226,0.0003004764,0.0001022174,0.0003095008,0.0002101207],"domain_scores_gemma":[0.9995748,0.00003176243,0.0001431753,0.0001210881,0.00007179862,0.00005737654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008728203,0.00001261466,0.0003061228,0.00003856293,0.00000551769,0.000003248484,0.006984244,0.002893696,0.007720265,0.005813982,0.00228771,0.9739253],"study_design_scores_gemma":[0.001455381,0.00006308016,0.05715766,0.0001165123,0.000009567408,0.0001369614,0.0003382414,0.8369568,0.01345731,0.002003913,0.0874569,0.0008476896],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.119898,0.00001793611,0.8764008,0.001991376,0.0002562301,0.00006470145,4.302548e-7,0.0001638601,0.001206603],"genre_scores_gemma":[0.9298236,3.43765e-7,0.05690966,0.01311006,0.0001071185,0.00000390112,0.00001692124,0.000002815672,0.00002552564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9730776,"threshold_uncertainty_score":0.4061684,"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."}}