{"id":"W2295016007","doi":"","title":"Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time.","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Combinatorics; Line (geometry); Binary logarithm; Point (geometry); Line segment; Reduction (mathematics); Time complexity; Mathematics; Algorithm; Computer science; Discrete mathematics; 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.0004709968,0.001505497,0.001448808,0.002324066,0.00131019,0.002277623,0.00329236,0.001038557,0.02214086],"category_scores_gemma":[0.003476306,0.0005737531,0.0008900567,0.005566714,0.0006573736,0.004226605,0.002529854,0.001376754,0.008830387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001051142,"about_ca_system_score_gemma":0.001820312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005208081,"about_ca_topic_score_gemma":0.01211282,"domain_scores_codex":[0.9980876,0.000229699,0.0001474161,0.0004399251,0.0007399398,0.0003553549],"domain_scores_gemma":[0.9978783,0.0005342317,0.0002116884,0.0007637343,0.0005129697,0.00009905073],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007137777,0.0002557691,0.002081675,0.0006543873,0.000122641,0.0003338088,0.0003120069,0.0194221,0.02796618,0.02520104,0.05219319,0.8707435],"study_design_scores_gemma":[0.0004028855,0.0005217411,0.003209515,0.0001666742,0.0002294498,0.002006918,0.0008040488,0.6725084,0.09709256,0.1240211,0.09880703,0.0002296974],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02697816,0.000861554,0.9347994,0.0003974115,0.0001851127,0.0003395466,0.001648037,0.01900822,0.01578259],"genre_scores_gemma":[0.1561169,0.0003754328,0.8202339,0.0002719047,0.00008695951,0.0003765641,0.005812746,0.001340267,0.01538524],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02214086,"threshold_uncertainty_score":0.07406855,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0261794865334309,"score_gpt":0.221253031092648,"score_spread":0.1950735445592171,"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."}}