{"id":"W1983271670","doi":"10.1016/j.jda.2006.09.004","title":"Computing the maximum clique in the visibility graph of a simple polygon","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Visibility graph; Simple polygon; Clique graph; Visibility polygon; Mathematics; Vertex (graph theory); Polygon covering; Graph; Block graph; Regular polygon; Discrete mathematics; Graph power; Line graph; 1-planar graph; Geometry","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.002016744,0.00009217698,0.0001715409,0.0001469063,0.0001068255,0.000094635,0.0007032935,0.00003402119,0.000002790743],"category_scores_gemma":[0.00005804719,0.0000501892,0.0001527006,0.0007774348,0.00005329942,0.0002991159,0.00008461937,0.0002350566,7.386686e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002446298,"about_ca_system_score_gemma":0.00008939828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001519966,"about_ca_topic_score_gemma":0.00004067541,"domain_scores_codex":[0.9983537,0.0002815475,0.000610318,0.0001273606,0.0004700164,0.0001570223],"domain_scores_gemma":[0.9987181,0.0003787979,0.0004426748,0.0002553807,0.0001787386,0.0000262482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001707036,0.001415698,0.02071932,0.0001179786,0.0001909493,0.0001879204,0.009331082,0.3563707,0.008683556,0.1513432,0.006756946,0.444712],"study_design_scores_gemma":[0.001249964,0.0005928382,0.277503,0.00006760098,0.0000297559,0.0003666459,0.0005674788,0.3599653,0.004115954,0.3536685,0.001623225,0.0002497515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3250095,0.0003997449,0.6715477,0.002483695,0.000209155,0.0001113153,0.000002770983,0.000005728045,0.0002303939],"genre_scores_gemma":[0.9803519,0.00001010839,0.01914726,0.0002084593,0.0002691719,8.107384e-7,0.00000232383,0.000003142617,0.00000684142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6553424,"threshold_uncertainty_score":0.2046656,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01063226809525173,"score_gpt":0.2687595671857121,"score_spread":0.2581272990904604,"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."}}