{"id":"W1968440069","doi":"10.1016/j.comgeo.2015.02.003","title":"Fast algorithms for approximate Fréchet matching queries in geometric trees","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Path (computing); Combinatorics; Matching (statistics); Mathematics; Tree (set theory); Data structure; Algorithm; Line segment; Line (geometry); Computer science; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.002436647,0.002102593,0.003880134,0.003708289,0.002014559,0.00584967,0.006129287,0.003982693,0.01852621],"category_scores_gemma":[0.02035551,0.00141194,0.002214375,0.008616387,0.001646727,0.01280241,0.007588462,0.003604204,0.005973151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003306388,"about_ca_system_score_gemma":0.002615233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006019135,"about_ca_topic_score_gemma":0.01006871,"domain_scores_codex":[0.9947736,0.0007112729,0.0004257394,0.001156362,0.00229241,0.0006407332],"domain_scores_gemma":[0.9893707,0.005571402,0.000530527,0.002916466,0.001247737,0.0003631801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001648893,0.000524363,0.003000714,0.0009199167,0.0002127197,0.0002444703,0.0008119924,0.130671,0.0109132,0.1175713,0.05022251,0.6832588],"study_design_scores_gemma":[0.000202405,0.0001410965,0.0004664508,0.00004929148,0.00006845663,0.0002638771,0.00039221,0.7801043,0.005246453,0.2047362,0.008279704,0.00004960167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03347829,0.001387739,0.9494423,0.0008733434,0.000221167,0.0002863539,0.001288376,0.008170976,0.004851589],"genre_scores_gemma":[0.2588568,0.0006708289,0.7259616,0.0003828649,0.0002347244,0.000439275,0.004969203,0.00150869,0.00697587],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01852621,"threshold_uncertainty_score":0.06197631,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04676608069297396,"score_gpt":0.2937886833154292,"score_spread":0.2470226026224553,"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."}}