{"id":"W142539835","doi":"10.22215/etd/2004-06003","title":"Computing Fréchet distance of two paths on a convex polyhedron","year":2004,"lang":"en","type":"dissertation","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Combinatorics; Mathematics; Simple (philosophy); Surface (topology); Geometry; Convex set; Convex optimization","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.0005822312,0.0009187112,0.001325207,0.002438656,0.0008903552,0.001768615,0.001473347,0.00149413,0.006056242],"category_scores_gemma":[0.006441467,0.0006724694,0.0009270921,0.001552991,0.001030422,0.003178157,0.002376976,0.001883717,0.0008230903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00120574,"about_ca_system_score_gemma":0.0009307803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003930571,"about_ca_topic_score_gemma":0.004162466,"domain_scores_codex":[0.9990839,0.00010135,0.00005308685,0.0002410352,0.0004034283,0.0001172704],"domain_scores_gemma":[0.9977449,0.001144617,0.0001954019,0.0002688757,0.0004752734,0.0001709704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008020364,0.0002647271,0.005325287,0.0005165377,0.0001557683,0.000625172,0.0006427548,0.333188,0.03028465,0.1511672,0.00591886,0.4711089],"study_design_scores_gemma":[0.0000438441,0.0002106844,0.0009630407,0.00002677962,0.00001772301,0.0001770058,0.0002162969,0.8865829,0.007869594,0.09970897,0.004142263,0.00004090357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1386703,0.0001688153,0.8567818,0.0001588633,0.00008163111,0.0001176744,0.0002620929,0.001070727,0.002688112],"genre_scores_gemma":[0.3806376,0.0001487762,0.6147531,0.00003541748,0.00002490501,0.0001258851,0.0008986794,0.0002469928,0.003128544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006056242,"threshold_uncertainty_score":0.02026016,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01115223455814664,"score_gpt":0.283126621200576,"score_spread":0.2719743866424293,"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."}}