{"id":"W2135516637","doi":"10.1109/cvpr.2013.280","title":"Efficient Computation of Shortest Path-Concavity for 3D Meshes","year":2013,"lang":"en","type":"article","venue":"","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; McGill University","keywords":"Polygon mesh; Shortest path problem; Mathematics; Convex hull; Computer science; Mathematical optimization; Convexity; Polygon (computer graphics); Algorithm; Regular polygon; Graph; Combinatorics; Geometry","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.00005342598,0.00005023657,0.00009874252,0.00003077155,0.00001624247,0.000009786963,0.00003134943,0.00002330541,0.00003952633],"category_scores_gemma":[0.000008020462,0.00004239496,0.00005058955,0.00005504992,0.000007293939,0.00001538699,0.000004762581,0.00002060067,0.00001716707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009510763,"about_ca_system_score_gemma":0.000002932157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005377257,"about_ca_topic_score_gemma":0.000004629702,"domain_scores_codex":[0.9996768,0.000003209397,0.0001253687,0.00006094229,0.00005538396,0.00007831772],"domain_scores_gemma":[0.9998168,0.00003201103,0.00001149474,0.00005596981,0.0000606839,0.00002301155],"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":[2.698156e-7,0.00001173539,0.0001746093,0.00001896595,0.00001764698,3.242768e-8,0.00005853942,0.9873072,0.001832552,0.00002782424,0.0003654311,0.01018521],"study_design_scores_gemma":[0.00007199339,0.000009605868,0.000474059,0.000007569257,0.00001686655,1.068093e-7,0.00003909159,0.997691,0.001552787,0.00007009894,0.00001418645,0.00005257944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.430635,0.00003695279,0.5684315,0.00001207759,0.00002620467,0.00005778316,0.000002113579,0.00006683588,0.0007315365],"genre_scores_gemma":[0.9839621,0.000001849557,0.0159363,0.00001006683,0.00001669623,0.00001352113,0.000006949265,0.000007706061,0.00004487032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5533271,"threshold_uncertainty_score":0.1728816,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01040363540441689,"score_gpt":0.2128098638536748,"score_spread":0.202406228449258,"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."}}