{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000201254,0.0002592592,0.0003379246,0.0002561429,0.0001091054,0.00008744213,0.0005622313,0.0001286018,0.00003636951],"category_scores_gemma":[0.00003729622,0.0002537707,0.0001326039,0.0005345399,0.00001812528,0.0001717333,0.00004657096,0.000217948,0.00004489613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009207813,"about_ca_system_score_gemma":0.0003490819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007309062,"about_ca_topic_score_gemma":0.0001065074,"domain_scores_codex":[0.9981893,0.00004988458,0.0004699089,0.0005302794,0.0005423159,0.0002183349],"domain_scores_gemma":[0.9987797,0.0001329436,0.0003828369,0.0004012724,0.0002297838,0.00007352022],"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.00004773152,0.0002724463,0.00006517939,0.0002400872,0.0000578884,0.00001494181,0.001825881,0.03070498,0.002165124,0.8711125,0.0005566564,0.09293653],"study_design_scores_gemma":[0.00667687,0.001969038,0.02388517,0.003440346,0.0001389936,0.00004722866,0.0007613773,0.5089552,0.2879337,0.1551492,0.007161972,0.003880859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09157741,0.0003816533,0.8799108,0.0001335203,0.001939373,0.0003292449,0.00001217689,0.0001680451,0.0255478],"genre_scores_gemma":[0.967494,0.00001222929,0.02699455,0.0002114914,0.0001673143,0.000006951869,0.0004783853,0.00001698507,0.0046181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8759166,"threshold_uncertainty_score":0.9999915,"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."}}