{"id":"W4244021806","doi":"10.1142/s0129626401000622","title":"A NOTE ON COMMUNICATION-EFFICIENT DETERMINISTIC PARALLEL ALGORITHMS FOR PLANAR POINT LOCATION AND 2D VORONOÏ DIAGRAM","year":2001,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Planar; Computation; Computer science; Interconnection; Algorithm; Diagram; Point (geometry); Point-to-point; Parallel algorithm; Point location; Parallel computing; Mathematics; Telecommunications; 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":[],"consensus_categories":[],"category_scores_codex":[0.0003378728,0.0001863441,0.0001620406,0.0001552861,0.0004764977,0.0002928825,0.0004145345,0.000053776,0.000001501703],"category_scores_gemma":[0.00008479011,0.0001828108,0.00004246275,0.0003328031,0.00007364127,0.0002805767,0.00005931253,0.0001167335,0.00001480249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006986996,"about_ca_system_score_gemma":0.00007568671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001292167,"about_ca_topic_score_gemma":0.000006991418,"domain_scores_codex":[0.9986572,0.00006488535,0.0002984516,0.0004500131,0.0002499033,0.0002795796],"domain_scores_gemma":[0.9989971,0.0002507928,0.0001728397,0.0003578418,0.0001253918,0.00009606158],"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.000105747,0.0002638569,0.0001030975,0.0001276043,0.00002159486,0.000009936789,0.002620313,0.4943999,0.0007841463,0.008224898,0.00123774,0.4921012],"study_design_scores_gemma":[0.0007349831,0.00010049,0.002383562,0.00007567583,0.00001331929,0.00003497507,0.00002413905,0.9925597,0.00005264804,0.001842821,0.001919751,0.0002579592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01862369,0.0004822173,0.9701761,0.01000248,0.0001226736,0.0003902894,0.000002075383,0.000113601,0.00008690023],"genre_scores_gemma":[0.7896292,0.00003249464,0.2071093,0.002862607,0.00009584266,0.0001479709,0.00004595082,0.00001248533,0.00006406868],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7710056,"threshold_uncertainty_score":0.7454808,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02666809811312965,"score_gpt":0.2859733324838822,"score_spread":0.2593052343707525,"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."}}