{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009025051,0.0007610886,0.001207003,0.003342634,0.0006785917,0.001993223,0.001406065,0.0009872199,0.001707085],"category_scores_gemma":[0.00831327,0.0005900048,0.0008632828,0.002190518,0.0009101527,0.00226984,0.001628433,0.001156757,0.0007053851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001923876,"about_ca_system_score_gemma":0.001381167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006589847,"about_ca_topic_score_gemma":0.0093586,"domain_scores_codex":[0.9989775,0.000129955,0.0000655264,0.0001586929,0.0005875715,0.00008076898],"domain_scores_gemma":[0.9973266,0.00132119,0.0002776339,0.0004630408,0.0005222904,0.0000892283],"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.0003573897,0.0001113328,0.005288212,0.0002503087,0.00008855141,0.0003050988,0.0004026686,0.5314938,0.04542832,0.03848245,0.004564605,0.3732273],"study_design_scores_gemma":[0.000005453399,0.00002532913,0.0005200416,0.00000472309,0.000003365168,0.00006733237,0.00003267375,0.988754,0.004275011,0.005646172,0.0006546527,0.00001124882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03780711,0.00009734331,0.9588608,0.00008608592,0.00001187515,0.00008165077,0.0002128782,0.001876431,0.0009658572],"genre_scores_gemma":[0.3983472,0.0001572413,0.5982934,0.00006912065,0.00002810259,0.0001827522,0.001102117,0.0005903946,0.001229668],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006589847,"threshold_uncertainty_score":0.01395875,"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."}}