{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002741763,0.0001550207,0.0002522565,0.000332668,0.0000719837,0.00009299317,0.0005164816,0.0001744967,0.000025491],"category_scores_gemma":[0.00004023538,0.0001575418,0.0001424918,0.0002610677,0.0000330833,0.0001497241,0.0006998146,0.0002781406,0.00002849405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004620298,"about_ca_system_score_gemma":0.0000997046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000984998,"about_ca_topic_score_gemma":0.00001495258,"domain_scores_codex":[0.9987715,0.00008512245,0.0003629004,0.0004051101,0.0002451334,0.0001302549],"domain_scores_gemma":[0.9989201,0.0001216954,0.0002268195,0.0004500187,0.0002147328,0.00006667203],"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.00002460515,0.000210437,0.001187264,0.0003927192,0.0004917616,0.000002828202,0.001591865,0.5563151,0.02019828,0.04285547,0.001359205,0.3753705],"study_design_scores_gemma":[0.0003409515,0.0002668727,0.01133807,0.00007280646,0.00005454883,0.00001387903,0.00002971369,0.8374555,0.137144,0.00944363,0.003332291,0.0005077491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1351002,0.000032221,0.8618225,0.000200194,0.001224535,0.0001407168,0.000005411235,0.0001352546,0.001338874],"genre_scores_gemma":[0.9498793,0.000004269874,0.04930174,0.00005328183,0.0003640038,0.00001594825,0.00003043442,0.000006545195,0.0003445128],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.814779,"threshold_uncertainty_score":0.6424368,"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."}}