{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001771883,0.0009056843,0.0009870158,0.0007122383,0.001047231,0.001672577,0.002027399,0.0008617555,0.003623961],"category_scores_gemma":[0.006859053,0.0007470637,0.001025257,0.002037075,0.001373999,0.003728568,0.001975863,0.002132169,0.00155067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001483213,"about_ca_system_score_gemma":0.001411528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004604114,"about_ca_topic_score_gemma":0.004775384,"domain_scores_codex":[0.9977653,0.0006386144,0.0001670713,0.0002719109,0.0009733942,0.0001836528],"domain_scores_gemma":[0.9973807,0.001615635,0.0001004406,0.0005267515,0.0003306714,0.00004580079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002886378,0.0000506947,0.0005731507,0.000360442,0.0000842847,0.0002483092,0.000167576,0.2512685,0.00559416,0.525789,0.02701064,0.1885647],"study_design_scores_gemma":[0.0000797492,0.00006727953,0.0002455347,0.00005214068,0.00004097814,0.0002162643,0.00004105235,0.640131,0.007792606,0.2672245,0.0840501,0.00005881503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001940577,0.001073559,0.9918951,0.0007159503,0.0004435986,0.00002706744,0.00006234053,0.0005032975,0.003338489],"genre_scores_gemma":[0.08142922,0.002669673,0.9080133,0.0006565029,0.0008253524,0.0001978092,0.000351305,0.0004601391,0.005396629],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004604114,"threshold_uncertainty_score":0.01212335,"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."}}