{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006362215,0.0004571555,0.0006602108,0.0007044214,0.00125026,0.001527012,0.0007507527,0.0008451089,0.003543448],"category_scores_gemma":[0.006411438,0.0005613728,0.0006892094,0.0006189331,0.001749073,0.003649682,0.002267562,0.00122746,0.0003326043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003211933,"about_ca_system_score_gemma":0.0007416628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001516973,"about_ca_topic_score_gemma":0.001654823,"domain_scores_codex":[0.9985935,0.0002080991,0.00008939797,0.0002532396,0.00032578,0.0005299336],"domain_scores_gemma":[0.9962812,0.001791073,0.0006889201,0.0004671834,0.0003874976,0.0003840527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008429167,0.0002049503,0.009322859,0.0004280478,0.00007888595,0.003812108,0.001813112,0.03984556,0.05858275,0.8273622,0.00339239,0.05431425],"study_design_scores_gemma":[0.0002083742,0.0003661656,0.006979001,0.0001225759,0.0001041218,0.00257419,0.003139143,0.08560473,0.05057045,0.8306199,0.01956387,0.0001474546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7335054,0.000234848,0.2427089,0.0004042029,0.0001284443,0.0001616583,0.0004936766,0.0005478818,0.02181499],"genre_scores_gemma":[0.9671451,0.0002152041,0.03009233,0.0001147968,0.0000455091,0.00007593452,0.0007875753,0.0001052639,0.001418268],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003543448,"threshold_uncertainty_score":0.01185399,"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."}}