{"id":"W2252238546","doi":"10.20382/jocg.v6i1a14","title":"A new algorithm for computing visibility graphs of polygonal obstacles in the plane","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Science Foundation","keywords":"Visibility; Visibility graph; Computer science; Plane (geometry); Algorithm; Planar graph; Mathematics; Graph; Theoretical computer science; Geometry; Physics; Regular polygon; Optics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"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.0003990952,0.001033473,0.0008843523,0.001724708,0.000764205,0.001180739,0.002008863,0.0009086095,0.004142713],"category_scores_gemma":[0.003196004,0.0007478794,0.001380068,0.001798034,0.000775042,0.003297927,0.002689522,0.001515387,0.0008701962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008077567,"about_ca_system_score_gemma":0.001434586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006491593,"about_ca_topic_score_gemma":0.009909702,"domain_scores_codex":[0.9993449,0.00007684575,0.00005647046,0.0001941003,0.0002279987,0.00009971722],"domain_scores_gemma":[0.9990262,0.0003527098,0.00009255371,0.0002418075,0.0002274787,0.00005927439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004717231,0.0001887975,0.002485027,0.0003873915,0.0001742729,0.0003168428,0.0003911423,0.2161733,0.02404537,0.05569896,0.01147467,0.6881925],"study_design_scores_gemma":[0.0001745148,0.0001532171,0.0008860026,0.00003931891,0.00007431423,0.0002904948,0.000128012,0.9164148,0.01242585,0.05545376,0.01389454,0.00006525554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01085184,0.00009814954,0.9854996,0.00009489357,0.00004062953,0.00008313137,0.0001674148,0.001798733,0.001365584],"genre_scores_gemma":[0.08319885,0.0001308448,0.9138885,0.00004761327,0.00002906463,0.0001351322,0.0008657965,0.0002611363,0.001443144],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006491593,"threshold_uncertainty_score":0.01385874,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02505012111509505,"score_gpt":0.2493882568495848,"score_spread":0.2243381357344898,"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."}}