{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011821,0.0008926351,0.001208028,0.001585659,0.0007814587,0.001407941,0.001554048,0.001785218,0.002749271],"category_scores_gemma":[0.008683411,0.0007710856,0.0006784768,0.001334173,0.001564194,0.002759606,0.001694885,0.0009667777,0.0003998223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001280378,"about_ca_system_score_gemma":0.0008163828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004198784,"about_ca_topic_score_gemma":0.002129958,"domain_scores_codex":[0.9993929,0.0001556775,0.00003598682,0.00016772,0.0001863747,0.00006140614],"domain_scores_gemma":[0.9976144,0.001498198,0.0003440415,0.0001620847,0.0002260257,0.0001552571],"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.0003166437,0.00004226274,0.001486549,0.0001783662,0.00003557597,0.0003703221,0.000238702,0.8196107,0.005991003,0.1431524,0.001217839,0.02735962],"study_design_scores_gemma":[0.00001840627,0.00006544715,0.0002963728,0.00001652027,0.00000761434,0.0001083558,0.00004518169,0.9545119,0.001394563,0.04169251,0.001822229,0.00002085584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2124416,0.0004338745,0.7773469,0.0003422517,0.0000482928,0.0001255901,0.0003698956,0.0002638769,0.008627653],"genre_scores_gemma":[0.7716756,0.0005740577,0.2197272,0.00004019459,0.00007106885,0.0001478863,0.0006813413,0.0001884818,0.006894148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004198784,"threshold_uncertainty_score":0.009289861,"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."}}