{"id":"W2626485963","doi":"","title":"A dynamic data structure for efficient bounded line range search","year":2010,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Bounded function; Line (geometry); Rectangle; Intersection (aeronautics); Combinatorics; Data structure; Line segment; Mathematics; Set (abstract data type); Range (aeronautics); Plane (geometry); Algorithm; Discrete mathematics; Computer science; Geometry; Mathematical analysis","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.001433075,0.001171648,0.001651788,0.003007224,0.001501718,0.002967796,0.00451172,0.001402668,0.01570142],"category_scores_gemma":[0.008138639,0.00125863,0.001179473,0.005676783,0.001141201,0.005373253,0.006025232,0.002232373,0.008142778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001453947,"about_ca_system_score_gemma":0.00212428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003453609,"about_ca_topic_score_gemma":0.003912821,"domain_scores_codex":[0.9977455,0.0002827081,0.0003612367,0.0004275618,0.0009399405,0.000243062],"domain_scores_gemma":[0.9951794,0.001265068,0.0003989171,0.002027161,0.0009174777,0.0002118545],"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.001303751,0.0003460806,0.002945541,0.000814071,0.0001053061,0.0003443683,0.0006052187,0.04296111,0.02456887,0.09058597,0.0760617,0.759358],"study_design_scores_gemma":[0.0006648558,0.0007102702,0.00153872,0.0003013932,0.0001197338,0.001100473,0.0005392167,0.5767998,0.05688352,0.1212905,0.2397408,0.0003107359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00448132,0.0004786084,0.9761392,0.0002700594,0.00007413352,0.0001832643,0.002298752,0.01336692,0.002707645],"genre_scores_gemma":[0.1021099,0.0005225582,0.8752448,0.0003317943,0.0001077284,0.00136502,0.0128291,0.002317956,0.005171109],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01570142,"threshold_uncertainty_score":0.05252647,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0316292291660358,"score_gpt":0.3200860811314963,"score_spread":0.2884568519654605,"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."}}