{"id":"W1993674183","doi":"10.1016/j.comgeo.2014.12.002","title":"A simple, faster method for kinetic proximity problems","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Delaunay triangulation; Graph; Complement graph; Equilateral triangle; Line graph; Dense graph; Discrete mathematics; Time complexity; Butterfly graph; Geometric graph theory; Graph power; Voltage graph; Pathwidth; 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.0007006691,0.0008996041,0.001140992,0.001179301,0.001062965,0.001387666,0.002167736,0.001679303,0.0222049],"category_scores_gemma":[0.003316149,0.0005682955,0.001068997,0.001005798,0.0006577289,0.001871118,0.002556593,0.002499078,0.006642544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004224153,"about_ca_system_score_gemma":0.001180405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001880169,"about_ca_topic_score_gemma":0.003380059,"domain_scores_codex":[0.9992932,0.00009870238,0.00003879977,0.00007551941,0.0004546822,0.0000390194],"domain_scores_gemma":[0.9989126,0.0003361345,0.00005220713,0.000268471,0.0003273656,0.0001032898],"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.0002832975,0.0003183371,0.0006763026,0.0007027868,0.0001169513,0.000394853,0.0003379161,0.09320386,0.04268189,0.1690874,0.03098956,0.6612069],"study_design_scores_gemma":[0.0001886608,0.0001077925,0.0003294105,0.00006328815,0.00004272239,0.0005171454,0.00008761185,0.8260695,0.0111762,0.08966512,0.07166491,0.00008753593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001718388,0.0001040859,0.9932376,0.0001322545,0.0002651077,0.00007781421,0.00006662121,0.0008368869,0.003561227],"genre_scores_gemma":[0.03496271,0.000183688,0.9479637,0.0001883191,0.0001455217,0.0002980137,0.00021293,0.001209391,0.01483584],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0222049,"threshold_uncertainty_score":0.07428282,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02248972339722848,"score_gpt":0.2877400102182937,"score_spread":0.2652502868210652,"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."}}