{"id":"W2002322113","doi":"","title":"In-place 2-d nearest neighbor search","year":2008,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nearest neighbor search; k-nearest neighbors algorithm; Computer science; Computational geometry; Preprocessor; Point (geometry); Set (abstract data type); Fixed-radius near neighbors; Permutation (music); Boundary (topology); Best bin first; Point location; Curse of dimensionality; Constant (computer programming); Regular polygon; Algorithm; Combinatorics; Mathematics; Data mining; Artificial intelligence; Geometry; Cluster analysis","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.0005019691,0.0005549412,0.001399792,0.0009861538,0.0007351457,0.001187092,0.002276163,0.001234399,0.009164586],"category_scores_gemma":[0.003312621,0.0004091641,0.0005873515,0.002196987,0.0006029078,0.002753715,0.002393057,0.0007331944,0.002417434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006498112,"about_ca_system_score_gemma":0.0006223628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002613317,"about_ca_topic_score_gemma":0.004498467,"domain_scores_codex":[0.9987534,0.0002212514,0.00008851248,0.0002998571,0.0004731192,0.000163877],"domain_scores_gemma":[0.9985316,0.0004001627,0.0001146353,0.0006813618,0.0002076649,0.00006457106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001983492,0.0004930861,0.004728704,0.0006911487,0.0001949341,0.0005687773,0.0005623154,0.2013347,0.0420916,0.04750654,0.04085092,0.6589937],"study_design_scores_gemma":[0.0002082986,0.0002303855,0.001132113,0.00004029801,0.00003652425,0.0004353476,0.0002626668,0.8809807,0.0303427,0.05882588,0.02745061,0.0000544353],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07871933,0.0008937851,0.9039265,0.0008601873,0.0002853379,0.0001472471,0.001165423,0.003343367,0.01065886],"genre_scores_gemma":[0.5734624,0.0003039981,0.4142034,0.0003341298,0.0001123967,0.00009545339,0.001688291,0.0002197473,0.009580277],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009164586,"threshold_uncertainty_score":0.03065854,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02888498650252969,"score_gpt":0.2638565760458083,"score_spread":0.2349715895432786,"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."}}