{"id":"W2146986633","doi":"","title":"Speed-Constrained Geodesic Fr echet Distance Inside a Simple Polygon","year":2010,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Simple polygon; Geodesic; Polygon (computer graphics); Tree traversal; Simple (philosophy); Path (computing); Mathematics; Shortest path problem; Combinatorics; Geometry; Monotone polygon; Computer science; Algorithm; Telecommunications; 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.0002084817,0.0001085923,0.00009693572,0.00009555616,0.0001234868,0.0001628693,0.000372873,0.00005339837,0.0001522895],"category_scores_gemma":[0.00006777523,0.0001001339,0.00004810365,0.0004163792,0.00003843981,0.0004635022,0.00009607335,0.0001572724,0.000115369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001385323,"about_ca_system_score_gemma":0.000107326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004349237,"about_ca_topic_score_gemma":0.0001937685,"domain_scores_codex":[0.9990728,0.00002322536,0.0001791356,0.0003077983,0.000211671,0.0002053784],"domain_scores_gemma":[0.9993038,0.0001001259,0.00005415341,0.0003528948,0.00008624951,0.0001028401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006172734,0.00008668604,0.000576949,0.000007062844,0.00001165159,0.00001312153,0.0002066857,0.002650554,0.07383668,0.832175,0.002842349,0.08758706],"study_design_scores_gemma":[0.0006584079,0.00008945973,0.01194702,0.000005994049,0.000006628779,0.00008193898,0.00002566928,0.7601786,0.0772259,0.08492375,0.06435976,0.0004968464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2422928,0.00001450014,0.7450767,0.001027525,0.000431448,0.00009099765,0.000003169591,0.000169252,0.01089362],"genre_scores_gemma":[0.9219992,0.000001289162,0.07624528,0.0007098388,0.0001566968,0.000003214482,0.00001491966,0.000004634405,0.0008649071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7575281,"threshold_uncertainty_score":0.4083341,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01240251686498882,"score_gpt":0.2468450217936542,"score_spread":0.2344425049286654,"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."}}