{"id":"W3023761765","doi":"10.20382/jocg.v11i1a1","title":"On optimal polyline simplification using the Hausdorff and Fréchet distance","year":2018,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Hausdorff distance; Subsequence; Combinatorics; Hausdorff space; Line segment; Line (geometry); Time complexity; Algorithm; Geometry; Mathematical analysis","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004185922,0.0001334058,0.0001654358,0.0006956431,0.0003949498,0.0001412179,0.0005171624,0.00005316161,0.00001800179],"category_scores_gemma":[0.00009025353,0.000112693,0.00008566782,0.001453276,0.0001523429,0.0006655,0.000116896,0.000190157,0.000005953937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001202826,"about_ca_system_score_gemma":0.0001949147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004052058,"about_ca_topic_score_gemma":0.000001330481,"domain_scores_codex":[0.998689,0.000118085,0.0002961261,0.0002189301,0.0005203676,0.0001575205],"domain_scores_gemma":[0.9980662,0.0004512519,0.0004223882,0.0001715056,0.0007754336,0.0001132006],"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.0001981498,0.0001445127,0.0003423818,0.00001078316,0.0001128512,0.00005037058,0.0004226692,0.6681176,0.0008454816,0.3129981,0.001116747,0.01564034],"study_design_scores_gemma":[0.001743388,0.0009413643,0.01376642,0.00007302936,0.00006949489,0.0005034826,0.0002545419,0.9303777,0.001353612,0.02167502,0.02885813,0.0003837874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3349638,0.00006668068,0.6635132,0.0008949733,0.0002625954,0.00005521533,0.000003909726,0.00001280217,0.0002267874],"genre_scores_gemma":[0.9399724,0.00001308428,0.05910705,0.000368912,0.0003241051,8.235111e-8,0.000004919606,0.00000586585,0.0002035707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6050087,"threshold_uncertainty_score":0.4595487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01587739429800557,"score_gpt":0.2400329222241248,"score_spread":0.2241555279261192,"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."}}