{"id":"W4240527869","doi":"10.1145/1109557.1109689","title":"A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Convex hull; Amortized analysis; Computational geometry; k-nearest neighbors algorithm; Regular polygon; Mathematics; Set (abstract data type); Euclidean geometry; Plane (geometry); Data structure; Point (geometry); Computer science; Algorithm; Discrete mathematics; Artificial intelligence; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003374231,0.00036419,0.0003644868,0.0001650346,0.000413956,0.0003480455,0.002262522,0.0001273572,0.000005485927],"category_scores_gemma":[0.000133214,0.0002797011,0.0001304473,0.0005259945,0.0001861832,0.001374357,0.001450725,0.0002128967,0.000003909424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005589282,"about_ca_system_score_gemma":0.00008602074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004790243,"about_ca_topic_score_gemma":0.00001267509,"domain_scores_codex":[0.9975306,0.00002338495,0.0005110517,0.0008704371,0.0006143241,0.0004502192],"domain_scores_gemma":[0.9982322,0.0001461124,0.0004226881,0.0006217911,0.0004579892,0.0001191781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001049606,0.002470558,0.01225475,0.003397838,0.001506382,0.00001687515,0.01022028,0.009808023,0.1007137,0.4419043,0.1618329,0.2548248],"study_design_scores_gemma":[0.004233625,0.001411941,0.02836257,0.0005019939,0.0002753737,0.0001723158,0.001180307,0.7891692,0.04045589,0.06919228,0.06319441,0.001850102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6990702,0.001886757,0.2335579,0.04338728,0.003037459,0.006351812,0.01028231,0.0007438758,0.001682423],"genre_scores_gemma":[0.8867319,0.00005110764,0.1098505,0.0004725886,0.0004496007,0.00006091347,0.0005872264,0.00004893128,0.001747251],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7793612,"threshold_uncertainty_score":0.9999655,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00865335346951196,"score_gpt":0.2471302054288218,"score_spread":0.2384768519593098,"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."}}