{"id":"W2963964459","doi":"10.20382/jocg.v7i2a3","title":"Shortest path in a polygon using sublinear space","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Science Foundation","keywords":"Sublinear function; Mathematics; Polygon (computer graphics); Simple polygon; Shortest path problem; Combinatorics; Path (computing); Space (punctuation); Constant (computer programming); K shortest path routing; Time complexity; Discrete mathematics; Algorithm; Monotone polygon; Computer science; Graph; Geometry","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006449755,0.0007426091,0.0008646605,0.0006049451,0.000606981,0.001556687,0.001252685,0.000749032,0.006494782],"category_scores_gemma":[0.005282702,0.0003713557,0.000903687,0.001141646,0.001047359,0.003797629,0.002113983,0.001803314,0.001177312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001259058,"about_ca_system_score_gemma":0.001242813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00330192,"about_ca_topic_score_gemma":0.004380537,"domain_scores_codex":[0.9990118,0.0002120587,0.00004772938,0.0002633911,0.0003289244,0.0001360873],"domain_scores_gemma":[0.9979883,0.001264366,0.0001453222,0.0003489891,0.0001753516,0.00007757085],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009093066,0.0001949311,0.001852594,0.0005500144,0.00009651032,0.0002767963,0.0004708784,0.4994462,0.01624011,0.1969846,0.01737732,0.2656008],"study_design_scores_gemma":[0.0000557293,0.00006008158,0.0001743825,0.00001197022,0.00001356714,0.00005079532,0.00005579588,0.9093714,0.00441177,0.08188692,0.003898185,0.000009379062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06458521,0.0003104142,0.9207439,0.0009611198,0.00009791466,0.00006562297,0.0003067387,0.002418816,0.01051018],"genre_scores_gemma":[0.4099177,0.000345539,0.5789321,0.000273802,0.00008223262,0.0002412485,0.0008669888,0.0006824291,0.008658073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006494782,"threshold_uncertainty_score":0.02172726,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03357880101853126,"score_gpt":0.2418161223360534,"score_spread":0.2082373213175222,"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."}}