{"id":"W1504893535","doi":"10.1007/978-3-540-68880-8_20","title":"Shortest Path Queries in Polygonal Domains","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Voronoi diagram; Shortest path problem; Computer science; Graph; Path (computing); Combinatorics; Distance; Domain (mathematical analysis); Time complexity; Algorithm; Theoretical computer science; Mathematics; 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.0007330026,0.0006429073,0.001725497,0.001084879,0.001036456,0.002406598,0.001913127,0.001584782,0.007395247],"category_scores_gemma":[0.005607169,0.0006489655,0.0006574666,0.003797833,0.001108571,0.005970491,0.003129812,0.001718163,0.001775956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00106537,"about_ca_system_score_gemma":0.0006306622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002317842,"about_ca_topic_score_gemma":0.002055457,"domain_scores_codex":[0.9985796,0.000267531,0.0001184885,0.0002340418,0.0006370812,0.0001632299],"domain_scores_gemma":[0.9976677,0.001651562,0.00008684624,0.0003247048,0.0001857684,0.00008342059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005336642,0.0001748593,0.0009120455,0.001420135,0.00006391112,0.000521519,0.0008102754,0.2159539,0.007763479,0.4059914,0.05575104,0.3101038],"study_design_scores_gemma":[0.00009888174,0.00005612628,0.0002775771,0.0001060264,0.00002639547,0.0004270284,0.0004935748,0.512366,0.006106833,0.4249154,0.05509118,0.00003491893],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07431361,0.003779856,0.8629953,0.001625622,0.0002984533,0.0002916745,0.002521361,0.003990645,0.05018351],"genre_scores_gemma":[0.4430307,0.004438303,0.5130998,0.0002966164,0.000259408,0.0003953721,0.007597412,0.001227969,0.02965443],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007395247,"threshold_uncertainty_score":0.02473956,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01478663836240333,"score_gpt":0.2347587505430358,"score_spread":0.2199721121806325,"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."}}