{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001299226,0.0001397008,0.0002941584,0.001257002,0.0000896557,0.00007208958,0.0009101237,0.00006523108,0.000004972482],"category_scores_gemma":[0.0001425276,0.0001234132,0.0001985664,0.002254663,0.00004958316,0.0006209956,0.0001053564,0.0001998087,0.000001333377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001223767,"about_ca_system_score_gemma":0.0007785439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003296393,"about_ca_topic_score_gemma":0.000005297216,"domain_scores_codex":[0.9980695,0.0001964567,0.0005362647,0.0002093831,0.0007975771,0.0001908503],"domain_scores_gemma":[0.9971457,0.001083367,0.0005712201,0.0001555594,0.0008856273,0.0001585465],"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.0002205952,0.0004424434,0.002440235,0.00003731476,0.0001587467,0.00009785796,0.002480365,0.6683311,0.0001002953,0.110957,0.003875602,0.2108584],"study_design_scores_gemma":[0.009807792,0.002087119,0.06382161,0.0001508056,0.0001042602,0.0005812181,0.002502482,0.7376823,0.0005809931,0.1650265,0.01702039,0.0006345069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1390589,0.00018165,0.859493,0.0005416191,0.000351504,0.0001495118,0.0000117103,0.00001069572,0.0002014474],"genre_scores_gemma":[0.6437804,0.000004594736,0.3558465,0.0001365139,0.000145915,1.093895e-7,0.00001555676,0.000004302902,0.00006607374],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5047215,"threshold_uncertainty_score":0.5032644,"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."}}