{"id":"W2052512910","doi":"10.1115/1.4026183","title":"Computation of the Shortest Path in a Bounded Domain With Free Form Boundary by Domain Partitioning","year":2013,"lang":"en","type":"article","venue":"Journal of Computing and Information Science in Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Shortest path problem; Euclidean shortest path; Polygon (computer graphics); Boundary (topology); Domain (mathematical analysis); Bounded function; Mathematics; Yen's algorithm; Computation; Algorithm; K shortest path routing; Topology (electrical circuits); Computer science; Discrete mathematics; Mathematical analysis; Dijkstra's algorithm; Combinatorics; Graph","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.0002716597,0.0004029211,0.000562438,0.0006724794,0.0004006932,0.0005935885,0.0007024421,0.0006282003,0.001857336],"category_scores_gemma":[0.001650605,0.0002799263,0.0005649811,0.0005948503,0.0004777045,0.0008861687,0.0007957322,0.0004730661,0.0003045236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004308264,"about_ca_system_score_gemma":0.0007243876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00408001,"about_ca_topic_score_gemma":0.003597316,"domain_scores_codex":[0.9998088,0.00003753576,0.00001213286,0.00003167285,0.00007880526,0.00003103827],"domain_scores_gemma":[0.9994851,0.0003389198,0.00003398274,0.00003987409,0.00008100887,0.00002103511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000100272,0.00003440851,0.001075164,0.0001405699,0.00001966986,0.0002064416,0.0001749721,0.9186277,0.00770731,0.02241781,0.001252784,0.0482429],"study_design_scores_gemma":[0.000007529833,0.00001693526,0.000123332,0.000005834957,0.000002587514,0.00003278683,0.00002985805,0.9898663,0.001255542,0.007772817,0.0008826263,0.000003804375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0509186,0.00007980975,0.9465938,0.00005289883,0.0000139208,0.00004230982,0.0001007423,0.0002566892,0.001941186],"genre_scores_gemma":[0.3682948,0.0001456901,0.6291532,0.00002383054,0.000008164499,0.0001252757,0.0004542019,0.0001235189,0.001671327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00408001,"threshold_uncertainty_score":0.00811249,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003650555759338471,"score_gpt":0.2015721580977552,"score_spread":0.1979216023384167,"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."}}