{"id":"W4243982841","doi":"10.1145/2493132.2462378","title":"Kinetic data structures for all nearest neighbors and closest pair in the plane","year":2013,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"k-nearest neighbors algorithm; Plane (geometry); Combinatorics; Mathematics; Function (biology); Algebraic number; Binary logarithm; Trajectory; Amortized analysis; Degree (music); Discrete mathematics; Data structure; 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.001859881,0.0009841017,0.00238284,0.002940463,0.002258641,0.00405726,0.004460879,0.001462485,0.007422395],"category_scores_gemma":[0.01353594,0.0009011826,0.001610557,0.005969299,0.001504002,0.01435769,0.004509609,0.003116378,0.003229517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001708348,"about_ca_system_score_gemma":0.002336126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00303305,"about_ca_topic_score_gemma":0.002959094,"domain_scores_codex":[0.9972634,0.0003763453,0.0004379338,0.0005662825,0.001143702,0.000212275],"domain_scores_gemma":[0.9927604,0.001294014,0.0009383614,0.003290582,0.001338964,0.0003776607],"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.0007888898,0.0003062292,0.002597651,0.0007060982,0.0001195951,0.0001864935,0.0005359135,0.1416714,0.004536336,0.6165607,0.02546565,0.2065251],"study_design_scores_gemma":[0.0001191552,0.0001447082,0.0004118032,0.00006086256,0.00004259241,0.0002938057,0.0002619828,0.3751557,0.004702404,0.594209,0.02452387,0.00007421501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01949288,0.000488464,0.9703884,0.0008780646,0.0001321316,0.0001861383,0.003275846,0.00210731,0.00305077],"genre_scores_gemma":[0.2333165,0.0009100251,0.7476656,0.0003059298,0.0001763982,0.0005513455,0.011331,0.0005313007,0.005211872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007422395,"threshold_uncertainty_score":0.02483034,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03229127608139164,"score_gpt":0.2595002029662812,"score_spread":0.2272089268848896,"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."}}