{"id":"W2016064056","doi":"10.1016/j.comgeo.2007.07.007","title":"I/O-efficient algorithms for computing planar geometric spanners","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Canadian Bioethics Society; Carleton University","funders":"","keywords":"Planar; Planar graph; Point (geometry); Plane (geometry); Computer science; Algorithm; Combinatorics; Mathematics; Theoretical computer science; Geometry; Computer graphics (images); Graph","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.0003566133,0.001535963,0.0008474306,0.001413171,0.0006760877,0.001286485,0.002228025,0.0008557959,0.01253004],"category_scores_gemma":[0.002705724,0.000486576,0.0008404781,0.002397415,0.0006954806,0.002940547,0.00294817,0.001252772,0.003003224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000709383,"about_ca_system_score_gemma":0.0008389934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001919561,"about_ca_topic_score_gemma":0.004926065,"domain_scores_codex":[0.9994709,0.00005483379,0.00003506094,0.0001108527,0.0002271149,0.0001012958],"domain_scores_gemma":[0.9991457,0.0003289095,0.0000819047,0.0002417067,0.0001525488,0.00004911917],"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.0003849919,0.0002410123,0.001294015,0.0004453306,0.00006529883,0.0001354091,0.0002977547,0.167432,0.01863327,0.0648122,0.01478451,0.7314742],"study_design_scores_gemma":[0.0001239477,0.0001339531,0.0003819993,0.00003760764,0.00004211069,0.0001111748,0.0002021007,0.865157,0.0181798,0.1070324,0.008571619,0.00002633787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02669695,0.000326548,0.9578785,0.0001133419,0.00006815318,0.00008916121,0.0002426919,0.003718953,0.01086573],"genre_scores_gemma":[0.201722,0.0003299239,0.7892227,0.0001037177,0.00005601866,0.0002114887,0.001086669,0.0007933064,0.006474266],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01253004,"threshold_uncertainty_score":0.0419172,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02830847977605489,"score_gpt":0.2941722439609533,"score_spread":0.2658637641848984,"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."}}