{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001032702,0.0003174801,0.0004057942,0.0004440035,0.0002384137,0.0002959363,0.0007183829,0.0001349249,0.0000105535],"category_scores_gemma":[0.0002310007,0.0003031674,0.0001923467,0.0005974016,0.00005330024,0.001693371,0.0004253268,0.0002686604,0.0001139722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001778033,"about_ca_system_score_gemma":0.000214817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003245234,"about_ca_topic_score_gemma":0.00005889239,"domain_scores_codex":[0.9975536,0.00003834506,0.0009937609,0.0003326132,0.0004350744,0.0006465476],"domain_scores_gemma":[0.9980237,0.0003492677,0.0003260979,0.0004893565,0.0005439898,0.0002675284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000558954,0.002205628,0.006459377,0.0006674188,0.0007392627,0.00004000804,0.06571651,0.0570024,0.001055742,0.07998439,0.02253497,0.7630354],"study_design_scores_gemma":[0.004032627,0.0002952032,0.0001356303,0.00006358475,0.00001418011,0.00004861136,0.0004147619,0.9747875,0.0006842995,0.005101785,0.01404736,0.0003743962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08183502,0.00003670995,0.9146168,0.0003831535,0.001101789,0.00117131,0.0001568439,0.0001613052,0.000537053],"genre_scores_gemma":[0.4700583,0.000003341561,0.5266666,0.001620067,0.0004441962,0.000257096,0.0005886516,0.00004284522,0.0003189517],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9177852,"threshold_uncertainty_score":0.9999421,"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."}}