{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008830064,0.0004768457,0.0004438103,0.0008904138,0.0004171738,0.0006943009,0.001446682,0.0002738596,0.00001032312],"category_scores_gemma":[0.00008212482,0.0004601819,0.0001281154,0.0007161767,0.0004615189,0.000913016,0.0007086137,0.0004258228,0.000006424822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000134901,"about_ca_system_score_gemma":0.0004119901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008372343,"about_ca_topic_score_gemma":0.00002098702,"domain_scores_codex":[0.996666,0.00002282906,0.0004565522,0.001593463,0.0006894324,0.0005717676],"domain_scores_gemma":[0.9979782,0.0004663873,0.0002362693,0.0007111531,0.0004098448,0.0001981932],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008472478,0.00003212127,0.00001622623,0.0000390884,0.00001207536,0.00002211323,0.0001875293,0.4176794,0.00004156322,0.04143049,0.00006555481,0.5404654],"study_design_scores_gemma":[0.0003341275,0.0002540304,0.00007045958,0.0000958056,0.00000962469,0.0001206291,1.048794e-7,0.8632348,0.0003768996,0.132025,0.002958759,0.0005197699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002267774,0.0007936184,0.9953503,0.0007559524,0.001161508,0.0007522483,0.00001078662,0.0001334703,0.000815345],"genre_scores_gemma":[0.008196041,0.0001481496,0.9898888,0.0007406141,0.0004641448,0.00003477266,0.00002179017,0.00002788258,0.0004778346],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5399457,"threshold_uncertainty_score":0.999785,"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."}}