{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009361135,0.0002168482,0.000245226,0.000431237,0.0002495396,0.0002400617,0.0005813081,0.00008449956,0.00002792166],"category_scores_gemma":[0.0002885888,0.0002152574,0.0001417876,0.001108819,0.00003124723,0.0005339472,0.0001852234,0.0001222849,0.0000663668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004740927,"about_ca_system_score_gemma":0.0001033517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005095063,"about_ca_topic_score_gemma":0.000002176378,"domain_scores_codex":[0.9979629,0.000146958,0.0004228733,0.0006270621,0.0004906213,0.0003495985],"domain_scores_gemma":[0.997785,0.001072801,0.0001726879,0.0003268824,0.0004943706,0.0001483098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009193819,0.000110914,0.0002314423,0.00007583561,0.00003160251,4.852478e-7,0.0001041514,0.6204703,0.0002560289,0.2518363,0.002354719,0.1245191],"study_design_scores_gemma":[0.000584026,0.0001457127,0.006174902,0.000009428341,0.000008502365,0.00001774026,0.000002944595,0.7542776,0.0001918728,0.2099285,0.0284419,0.0002168557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004568819,0.00007744011,0.9925087,0.0008397498,0.0004170322,0.0005712621,0.00001240101,0.0001986838,0.0008059208],"genre_scores_gemma":[0.4147133,7.817504e-7,0.5833302,0.001128809,0.0002720222,0.0001051657,0.0001305415,0.00001371133,0.0003055335],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4101444,"threshold_uncertainty_score":0.8777944,"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."}}