{"id":"W2252725190","doi":"10.4230/lipics.socg.2015.733","title":"A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Algorithm; Computer science; Combinatorics; Mathematics; 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.0009433473,0.002081285,0.002637199,0.002300551,0.002106805,0.002510736,0.004262163,0.002516421,0.02654521],"category_scores_gemma":[0.005565477,0.001352877,0.002848138,0.004269163,0.001660836,0.004654999,0.006319183,0.004075435,0.008212509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00192398,"about_ca_system_score_gemma":0.002238754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007462536,"about_ca_topic_score_gemma":0.00854545,"domain_scores_codex":[0.9976808,0.0002151325,0.0002090976,0.000577005,0.0009640465,0.000353956],"domain_scores_gemma":[0.9972878,0.001145819,0.00009078155,0.0007485002,0.0005949,0.0001321581],"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.0007659536,0.0003633631,0.001051757,0.000679395,0.0001631825,0.0003677059,0.000763726,0.069276,0.018487,0.07080611,0.02744186,0.8098339],"study_design_scores_gemma":[0.0006240548,0.000267295,0.0006373245,0.0000809647,0.0001208323,0.0005111922,0.0003858884,0.7937176,0.02531356,0.1446747,0.03347935,0.0001872462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004946107,0.0001562691,0.9867632,0.0001914549,0.00008433697,0.000143338,0.0001915345,0.004214089,0.003309696],"genre_scores_gemma":[0.05489603,0.0001086054,0.9394588,0.0001193341,0.00004272537,0.000281029,0.0011104,0.0008737652,0.003109289],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02654521,"threshold_uncertainty_score":0.08880252,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03449451087858447,"score_gpt":0.2983521168747839,"score_spread":0.2638576059961994,"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."}}