{"id":"W2624483937","doi":"10.1145/1706591.1706596","title":"A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries","year":2010,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Convex hull; Amortized analysis; Mathematics; Regular polygon; Euclidean geometry; Set (abstract data type); Data structure; Point (geometry); k-nearest neighbors algorithm; Computational geometry; Plane (geometry); Extreme point; Discrete mathematics; Algorithm; Computer science; 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.0002551927,0.00005115158,0.00008396037,0.00004000547,0.0001148595,0.0001468141,0.002035632,0.00003051489,0.000007868714],"category_scores_gemma":[0.0008625677,0.0000315701,0.00002953064,0.0001069448,0.00003350797,0.0004696629,0.0007423902,0.0001546121,5.529747e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005706662,"about_ca_system_score_gemma":0.0001039798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000143511,"about_ca_topic_score_gemma":0.00003391606,"domain_scores_codex":[0.9995185,0.00002068532,0.0001502979,0.00009642963,0.0001439098,0.00007015379],"domain_scores_gemma":[0.9986727,0.0001657456,0.0001802517,0.0008098229,0.0001321448,0.00003935381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002143439,0.0001652382,0.005571071,0.0001340341,0.0003087397,0.00002041904,0.002460431,0.004964085,0.4413306,0.1251946,0.04962249,0.370014],"study_design_scores_gemma":[0.001730828,0.0003259829,0.1117994,0.00005455023,0.00007368864,0.001337937,0.00006734934,0.3666494,0.009373588,0.3944958,0.1137689,0.0003224633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8325286,0.0001714429,0.147606,0.01726277,0.002263975,0.0001172977,0.00002715604,0.000007497341,0.00001521896],"genre_scores_gemma":[0.8374127,0.000007431706,0.1619522,0.0003507477,0.0001858542,3.725272e-7,0.000003104757,0.000002857416,0.00008474027],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.431957,"threshold_uncertainty_score":0.3782745,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01828957927246067,"score_gpt":0.2856817733615128,"score_spread":0.2673921940890522,"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."}}