{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005969875,0.0004686324,0.0004550897,0.001275924,0.0002620368,0.000330978,0.001947659,0.0002651903,0.00002210779],"category_scores_gemma":[0.00008109942,0.0004614439,0.0001158899,0.001098564,0.0005307128,0.0007535574,0.0008229754,0.0006849268,0.00003984106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003362276,"about_ca_system_score_gemma":0.00102439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003168303,"about_ca_topic_score_gemma":0.0002226965,"domain_scores_codex":[0.9963207,0.0000403335,0.0005791174,0.001374468,0.001093626,0.0005917791],"domain_scores_gemma":[0.9982125,0.0004159362,0.0001967004,0.0008211724,0.000195181,0.0001585757],"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.00001185642,0.00009328465,0.0004528723,0.00002036263,0.00001126468,0.0005147295,0.00170573,0.2744944,0.0002074159,0.05855781,0.0001585418,0.6637717],"study_design_scores_gemma":[0.0006029832,0.0003141969,0.004700182,0.000391771,0.00000555303,0.0005138966,3.057034e-7,0.8349144,0.001002678,0.1464478,0.009741732,0.001364458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000878245,0.0008053536,0.9927703,0.0006898606,0.001479983,0.0002855209,0.000006673486,0.0001102426,0.002973835],"genre_scores_gemma":[0.5481708,0.0002550797,0.4478104,0.002117065,0.0009082014,0.00001836102,0.00003122083,0.00003698886,0.0006518636],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6624073,"threshold_uncertainty_score":0.9997838,"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."}}