{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00156814,0.0009614959,0.00237091,0.001983565,0.002067772,0.002752073,0.005893496,0.001961146,0.007327477],"category_scores_gemma":[0.01094966,0.001249873,0.001596905,0.004760856,0.001860649,0.008079945,0.007836561,0.002894826,0.003411871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001954763,"about_ca_system_score_gemma":0.002578992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002981155,"about_ca_topic_score_gemma":0.003885075,"domain_scores_codex":[0.9965867,0.0004237773,0.000399608,0.0006989636,0.001558619,0.0003323311],"domain_scores_gemma":[0.9925635,0.001673202,0.000643571,0.003894929,0.0008331597,0.0003916226],"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.001798795,0.0008508137,0.003989939,0.0006661648,0.0001758642,0.0004360455,0.0006519273,0.1954479,0.02826419,0.2050124,0.06251624,0.5001898],"study_design_scores_gemma":[0.0003827981,0.0004453953,0.0005447753,0.00006373932,0.00006089019,0.0004295713,0.0001577281,0.8269182,0.01454447,0.1190874,0.03722724,0.0001377119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01360449,0.0004472016,0.975055,0.0008574957,0.0001651625,0.0002302435,0.001720108,0.005632168,0.002288193],"genre_scores_gemma":[0.1924306,0.0003900201,0.7944791,0.0005208132,0.0002344203,0.001137778,0.005799183,0.0007907459,0.004217348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007327477,"threshold_uncertainty_score":0.02451283,"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."}}