{"id":"W2044633855","doi":"10.1016/j.comgeo.2010.04.005","title":"Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Combinatorics; Convex hull; Voronoi diagram; Output-sensitive algorithm; Regular polygon; Mathematics; Randomized algorithm; Line segment; Point (geometry); Computational geometry; Algorithm; Computer science; Convex combination; 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.0004952055,0.0001609267,0.000175877,0.0005065214,0.0001608424,0.0002055889,0.0001768229,0.00009131608,0.00001137777],"category_scores_gemma":[0.00009919471,0.0001730458,0.00003773739,0.0005438649,0.0000702712,0.0004281389,0.0001600162,0.0002036293,0.000005977767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003905407,"about_ca_system_score_gemma":0.00009161729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001304018,"about_ca_topic_score_gemma":0.00001660979,"domain_scores_codex":[0.9987336,0.00003619391,0.000282301,0.0004823678,0.0002466756,0.0002189029],"domain_scores_gemma":[0.9989805,0.0004938573,0.00009321694,0.0001315613,0.0001806497,0.0001202729],"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.0001258167,0.0005489811,0.0069778,0.0001981788,0.000131024,0.00002534091,0.003445188,0.4433764,0.006080793,0.1381233,0.002212443,0.3987547],"study_design_scores_gemma":[0.001188922,0.0001808655,0.03497999,0.00001436039,0.000007498435,0.0001402958,0.00007435412,0.9504527,0.0005199083,0.0106585,0.001527007,0.0002555291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4702269,0.00009966567,0.5284214,0.0004635524,0.0004806331,0.0002111906,0.000007695025,0.00003900763,0.00004989157],"genre_scores_gemma":[0.7723798,0.000007510811,0.2270113,0.0002624589,0.0001352247,0.00003781362,0.00004779764,0.00000810239,0.0001100204],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5070764,"threshold_uncertainty_score":0.7056603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01289115093811853,"score_gpt":0.2642578783970998,"score_spread":0.2513667274589813,"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."}}