{"id":"W1769594948","doi":"10.1137/1.9781611973730.109","title":"Optimal detection of intersections between convex polyhedra","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Polyhedron; Combinatorics; Intersection (aeronautics); Dimension (graph theory); Regular polygon; Binary logarithm; Mathematics; Time complexity; Convex polytope; Computational geometry; Constant (computer programming); Representation (politics); Discrete mathematics; Algorithm; Computer science; Convex set; Convex optimization; Geometry","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.001086706,0.0009525043,0.00231911,0.002411883,0.001224742,0.003372214,0.003228276,0.001954127,0.005899634],"category_scores_gemma":[0.01822064,0.001367747,0.001685706,0.002701718,0.001731269,0.004277342,0.00389062,0.001849724,0.001732389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001264918,"about_ca_system_score_gemma":0.001432884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002312683,"about_ca_topic_score_gemma":0.002297461,"domain_scores_codex":[0.9948764,0.0007353851,0.0003885107,0.001204661,0.002001253,0.0007937392],"domain_scores_gemma":[0.9899887,0.005389861,0.001018096,0.001684217,0.001426839,0.0004923127],"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.004175058,0.0007015852,0.040198,0.001280425,0.0003175689,0.001847748,0.0009991574,0.1566524,0.1233041,0.05277503,0.01960866,0.5981402],"study_design_scores_gemma":[0.0001522059,0.0003469489,0.007191399,0.00006334535,0.00005157741,0.000760547,0.0008504213,0.8586572,0.0639183,0.06213946,0.005779308,0.00008931074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3786636,0.000743673,0.6031487,0.001153512,0.0001572226,0.0003783083,0.001761474,0.005160189,0.008833277],"genre_scores_gemma":[0.6096282,0.0002192906,0.3833633,0.000199448,0.00007181359,0.0001717376,0.004368767,0.0005527321,0.00142467],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005899634,"threshold_uncertainty_score":0.01973623,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0221091149270734,"score_gpt":0.2667077151842954,"score_spread":0.244598600257222,"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."}}