{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001331496,0.0000782563,0.0001297371,0.0004659131,0.0001237501,0.0003269524,0.0003894295,0.00002338996,5.85818e-7],"category_scores_gemma":[0.000118865,0.00005732941,0.00002203961,0.001412713,0.00007687316,0.005327357,0.0001062827,0.0001612776,3.581766e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008845395,"about_ca_system_score_gemma":0.0001805375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001557699,"about_ca_topic_score_gemma":0.000002978884,"domain_scores_codex":[0.998665,0.00002199596,0.0005815969,0.00007617427,0.0004911448,0.0001640462],"domain_scores_gemma":[0.9991383,0.00009211127,0.000352052,0.0001047701,0.0002616397,0.00005112429],"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.000005478234,0.00003434694,0.007567433,0.00003915537,0.000004365921,0.000001009283,0.007066881,0.9579927,0.002480261,0.009565572,0.00008929286,0.01515356],"study_design_scores_gemma":[0.0005631385,0.00008594604,0.1014004,0.0002592132,9.949961e-7,0.00007824519,0.0003293007,0.8931839,0.0005439704,0.003331733,0.0001340888,0.00008907525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5393286,0.00002260033,0.4601893,0.0002230776,0.0001101315,0.00006421623,2.117116e-7,0.000005212301,0.00005672179],"genre_scores_gemma":[0.9440884,0.000004297826,0.05582,0.0000665814,0.00001649216,0.000001488225,6.253973e-7,0.000001662211,4.824179e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4047598,"threshold_uncertainty_score":0.3862205,"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."}}