{"id":"W1492058106","doi":"10.1007/3-540-44634-6_2","title":"Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Christian ministry; Quadratic equation; Algorithm; Planar; Computer science; Planar graph; Graph; Combinatorics; Mathematics; Theoretical computer science; 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.003103628,0.001579059,0.002394531,0.001789469,0.001287175,0.002583747,0.003384636,0.003081044,0.00538142],"category_scores_gemma":[0.02427612,0.001437226,0.00133283,0.002853876,0.002754119,0.005504038,0.004452501,0.003038024,0.001348335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001967424,"about_ca_system_score_gemma":0.002298723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003016989,"about_ca_topic_score_gemma":0.003065085,"domain_scores_codex":[0.9966272,0.001120893,0.0001820206,0.0008384901,0.0009594135,0.0002720092],"domain_scores_gemma":[0.9903819,0.005939274,0.0007070643,0.00187956,0.0007977564,0.0002944948],"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.0003413128,0.0001259633,0.0004395898,0.0002836953,0.00006150187,0.00007074671,0.0001923141,0.6206173,0.002715428,0.1603674,0.01077571,0.204009],"study_design_scores_gemma":[0.00003366469,0.0000570944,0.0001033532,0.00002468834,0.00001896681,0.00006921434,0.00004351797,0.8303235,0.001377294,0.1656075,0.002323147,0.00001821197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00608573,0.0004895738,0.9904459,0.0002242454,0.00005479816,0.00003627074,0.00007012321,0.0004435687,0.002149782],"genre_scores_gemma":[0.1482346,0.0007227118,0.8451627,0.0001468569,0.0001490157,0.0001942024,0.0003567237,0.0004450219,0.004588085],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00538142,"threshold_uncertainty_score":0.01800257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0318007421251974,"score_gpt":0.2598732145455561,"score_spread":0.2280724724203587,"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."}}