{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004617229,0.0006208562,0.001326306,0.001301671,0.0009494174,0.001688606,0.001270244,0.001332092,0.004272192],"category_scores_gemma":[0.005093167,0.0008481442,0.0009469638,0.0013103,0.001130793,0.002268892,0.00132077,0.001002039,0.0004023966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006423551,"about_ca_system_score_gemma":0.0008423874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006884831,"about_ca_topic_score_gemma":0.01103667,"domain_scores_codex":[0.9995869,0.00009687208,0.00001660775,0.0001281876,0.00009030211,0.00008117326],"domain_scores_gemma":[0.997272,0.001884667,0.0002220166,0.0002281191,0.0001592852,0.0002338339],"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.002087203,0.0004909625,0.01588642,0.0007365217,0.0003307255,0.0009923042,0.0009194177,0.7265751,0.02656665,0.06394501,0.01134266,0.150127],"study_design_scores_gemma":[0.00007787602,0.00008314221,0.00170887,0.00001971182,0.00003609975,0.0001042457,0.0002102514,0.9450856,0.003386919,0.04794081,0.001331142,0.00001540231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6732736,0.0003777743,0.3168333,0.0008719206,0.00006991861,0.0001370215,0.001142781,0.0007855619,0.006508138],"genre_scores_gemma":[0.8448274,0.0001858754,0.1505483,0.00006299851,0.00004976155,0.000049047,0.001406692,0.0002683893,0.002601596],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006884831,"threshold_uncertainty_score":0.01429188,"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."}}