{"id":"W2175772512","doi":"10.1016/j.jda.2012.04.009","title":"Kinetic Euclidean minimum spanning tree in the plane","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Euclidean minimum spanning tree; Delaunay triangulation; Mathematics; Combinatorics; Spanning tree; Constrained Delaunay triangulation; Minimum spanning tree; Bowyer–Watson algorithm; Plane (geometry); Euclidean geometry; Euclidean space; Pitteway triangulation; Triangulation; Geometry; Kruskal's algorithm","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.0002375109,0.0002590288,0.0006579019,0.0006550596,0.0003989612,0.001009124,0.000807462,0.000869116,0.003694373],"category_scores_gemma":[0.001447607,0.0002201363,0.0002472124,0.0008005175,0.0004818851,0.001660802,0.0006883151,0.0007119207,0.000554818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004905,"about_ca_system_score_gemma":0.0003214185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001092732,"about_ca_topic_score_gemma":0.001048218,"domain_scores_codex":[0.9998895,0.00003056851,0.000007887686,0.0000207208,0.00003590324,0.00001542694],"domain_scores_gemma":[0.9997225,0.0001172235,0.00004680673,0.00002504956,0.00005272157,0.00003568096],"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.0002208712,0.00004408716,0.0006421344,0.0002100665,0.00003070243,0.0001819261,0.0001051224,0.3545114,0.003929298,0.6002984,0.004700799,0.03512533],"study_design_scores_gemma":[0.00004250844,0.00003621305,0.0003650388,0.00002163659,0.00001224556,0.0001791979,0.00007262623,0.6569524,0.0006528461,0.3377703,0.003881708,0.00001326928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.284447,0.001792319,0.6711146,0.001345296,0.0001760908,0.00008225576,0.0008425897,0.0003394689,0.03986046],"genre_scores_gemma":[0.8797243,0.001480917,0.1027927,0.0001401247,0.00005593157,0.00006795311,0.0007507724,0.0001150725,0.01487218],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003694373,"threshold_uncertainty_score":0.01235896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02183772406415762,"score_gpt":0.2748747911010951,"score_spread":0.2530370670369375,"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."}}