{"id":"W7098101160","doi":"","title":"[GM91] S. K. Ghosh and D. M. Mount. An output-sensitive algorithm for computing visibility graphs.","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Voronoi diagram; Visibility; Regular polygon; Computational geometry; Algebraic number; Robot; Time complexity","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001799241,0.003036645,0.002565692,0.007407844,0.002313055,0.002361966,0.004766999,0.00237132,0.03083547],"category_scores_gemma":[0.01226578,0.003705651,0.003306991,0.009954283,0.002422066,0.009049202,0.005567934,0.004149182,0.02035281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001804522,"about_ca_system_score_gemma":0.002516512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0141618,"about_ca_topic_score_gemma":0.02090372,"domain_scores_codex":[0.9980578,0.0003081114,0.0002219344,0.0003706791,0.0008145874,0.0002268989],"domain_scores_gemma":[0.9958926,0.001676725,0.0001986766,0.00155997,0.0005315001,0.0001405712],"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.0004888575,0.0001288746,0.002074257,0.0004787705,0.0001811719,0.0001658109,0.0005123352,0.02270348,0.003380429,0.04592479,0.2034946,0.7204667],"study_design_scores_gemma":[0.0004614813,0.0001995642,0.003413239,0.0003348254,0.0003454058,0.001105628,0.0005839615,0.214833,0.01704253,0.4721119,0.289163,0.0004055818],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008260652,0.007358427,0.9464754,0.00172021,0.0005151558,0.0003044535,0.004393964,0.01554548,0.01542612],"genre_scores_gemma":[0.06067467,0.00514493,0.9105361,0.0006737137,0.0002746904,0.0005075942,0.01025693,0.003455339,0.008476063],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03083547,"threshold_uncertainty_score":0.103155,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01779418017535593,"score_gpt":0.2914040701005979,"score_spread":0.273609889925242,"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."}}