{"id":"W2015391423","doi":"10.1145/2462356.2462378","title":"Kinetic data structures for all nearest neighbors and closest pair in the plane","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; k-nearest neighbors algorithm; Plane (geometry); Mathematics; Algebraic number; Function (biology); Amortized analysis; Binary logarithm; Degree (music); Trajectory; Kinetic energy; Discrete mathematics; Data structure; Algorithm; Physics; Computer science; Mathematical analysis; Geometry; Artificial intelligence","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.002416589,0.001073405,0.002541733,0.003243444,0.002344209,0.004813571,0.004834556,0.001465292,0.007259932],"category_scores_gemma":[0.01686212,0.001007216,0.001778408,0.006633065,0.001493753,0.01510186,0.004973962,0.003353699,0.003693678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001769005,"about_ca_system_score_gemma":0.00285334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003237456,"about_ca_topic_score_gemma":0.003163065,"domain_scores_codex":[0.9964731,0.0004845852,0.0006334491,0.0006397828,0.001522225,0.0002466398],"domain_scores_gemma":[0.9911836,0.001486681,0.001066815,0.004182082,0.001671197,0.0004095276],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009200002,0.0003164615,0.003193516,0.0007809902,0.0001405547,0.000210529,0.0005965929,0.1408014,0.004330734,0.5714453,0.03089476,0.2463691],"study_design_scores_gemma":[0.0001418502,0.0001693103,0.0004795074,0.00008210277,0.00004844419,0.0003586358,0.0003031529,0.4076515,0.005307894,0.5499854,0.03538103,0.00009130533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01285621,0.0004939627,0.9773456,0.0007709754,0.0001394727,0.0001801141,0.003314633,0.002358106,0.002540917],"genre_scores_gemma":[0.1733408,0.0009168896,0.807802,0.0002858283,0.0001774936,0.000560943,0.01209798,0.0005309628,0.00428724],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007259932,"threshold_uncertainty_score":0.02428693,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04426051183283414,"score_gpt":0.2701916494062924,"score_spread":0.2259311375734582,"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."}}