{"id":"W2113528966","doi":"10.1142/s0218195900000061","title":"ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Visibility graph; Mathematics; Bipartite graph; Combinatorics; Visibility; Polygon (computer graphics); Planar graph; Enhanced Data Rates for GSM Evolution; Graph; Visibility polygon; Polygon covering; Discrete mathematics; Geometry; Regular polygon; Computer science; Artificial intelligence; Optics; Telecommunications","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.0005708858,0.0002221862,0.0003253757,0.00094294,0.0001454805,0.0001474733,0.001474161,0.00007552268,0.0002485933],"category_scores_gemma":[0.00003375711,0.0002002588,0.0002477019,0.001612331,0.0002198291,0.0008831858,0.00009566746,0.0002579951,0.00004224138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008977114,"about_ca_system_score_gemma":0.0005292182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004639761,"about_ca_topic_score_gemma":0.000002736914,"domain_scores_codex":[0.9967642,0.00009394529,0.001042808,0.0003648542,0.001523922,0.0002102606],"domain_scores_gemma":[0.9958369,0.0004965526,0.0007281182,0.0003165786,0.002438984,0.0001828842],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001932301,0.001002011,0.003026449,0.00002158513,0.0004804121,0.00001885549,0.0001784829,0.3473834,0.0003837441,0.3200594,0.0003904753,0.3268619],"study_design_scores_gemma":[0.006682706,0.001419376,0.1689618,0.0002766438,0.0002229278,0.003044528,0.0001749696,0.04261087,0.003873955,0.6126922,0.158558,0.001481916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1176092,0.0004020243,0.8784487,0.0009666473,0.0001824264,0.0002861838,0.0000547667,0.00004336652,0.002006667],"genre_scores_gemma":[0.8624962,0.00005967588,0.1365997,0.0002855143,0.0002844637,0.00003706358,0.00007802456,0.00001287833,0.0001465103],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.744887,"threshold_uncertainty_score":0.8166316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008723127740412584,"score_gpt":0.2677453525527823,"score_spread":0.2590222248123698,"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."}}