{"id":"W2184499742","doi":"","title":"Convexifying Polygons Without Losing Visibilities","year":2011,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Ottawa","funders":"","keywords":"Vertex (graph theory); Simple polygon; Combinatorics; Polygon (computer graphics); Star-shaped polygon; Rectilinear polygon; Regular polygon; Visibility polygon; Polygon covering; Mathematics; Point in polygon; Enhanced Data Rates for GSM Evolution; Convex set; Computer science; Geometry; Graph; Artificial intelligence; Telecommunications; Convex optimization","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.0001449922,0.00006284908,0.00006234139,0.00008676087,0.0001045407,0.00007138634,0.0002222181,0.00002138232,0.0001246254],"category_scores_gemma":[0.00001903617,0.00005621087,0.00002890611,0.0002018429,0.00002116228,0.0004692306,0.00008560552,0.00004169843,0.00007872327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001276501,"about_ca_system_score_gemma":0.00004438724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003833319,"about_ca_topic_score_gemma":0.00000678651,"domain_scores_codex":[0.9994164,0.00002568586,0.0001187959,0.0001891909,0.0001234889,0.000126431],"domain_scores_gemma":[0.9996273,0.00003494886,0.00002887923,0.0001986828,0.00006042836,0.0000497566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005487837,0.00006514365,0.004747655,0.00001041887,0.0000157152,0.000004136632,0.003917368,0.0001479018,0.00209149,0.9487691,0.0004668076,0.03975876],"study_design_scores_gemma":[0.001055886,0.0003617084,0.05201634,0.00005553537,0.00001958464,0.0001344476,0.0007582877,0.5423161,0.1937235,0.2007264,0.007774703,0.001057388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06196216,0.00005347179,0.8944149,0.0001180589,0.000278095,0.00005259437,2.527236e-7,0.000162187,0.04295829],"genre_scores_gemma":[0.8284541,0.00000147066,0.1698093,0.0003638456,0.00004216555,0.000002725021,9.257299e-7,0.00000255017,0.001322915],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7664919,"threshold_uncertainty_score":0.2292213,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06451392659182047,"score_gpt":0.2615321981476595,"score_spread":0.197018271555839,"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."}}