{"id":"W2088816968","doi":"10.1016/j.comgeo.2005.05.001","title":"A linear time algorithm to remove winding of a simple polygon","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Simple polygon; Simple (philosophy); Polygon (computer graphics); Stack (abstract data type); Algorithm; Sequence (biology); SIMPLE algorithm; Point (geometry); Time complexity; Polygon covering; Point in polygon; Mathematics; Computer science; Monotone polygon; Combinatorics; Geometry; Physics","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.0004023291,0.0001732306,0.0002347191,0.0007722739,0.0001373952,0.0000705929,0.0005353302,0.00006600902,0.000107436],"category_scores_gemma":[0.0001284055,0.0001892123,0.0001062106,0.002129235,0.00002753298,0.0004700974,0.0002644314,0.0001130039,0.0005435421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008771573,"about_ca_system_score_gemma":0.0001572283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006651049,"about_ca_topic_score_gemma":7.250846e-7,"domain_scores_codex":[0.9981374,0.00005681249,0.0004562536,0.0004352621,0.0006374715,0.0002767642],"domain_scores_gemma":[0.9986903,0.000331097,0.0001545945,0.0002773436,0.0003633263,0.0001833535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008652102,0.0001327481,0.00009872365,0.00001018467,0.00003331236,0.000003718692,0.0002736113,0.668473,0.001533983,0.008480816,0.002392294,0.318559],"study_design_scores_gemma":[0.0003678499,0.0001310348,0.005498577,0.00001817269,0.00000641818,0.00003483541,0.000008752587,0.9734206,0.003200799,0.007108401,0.009964296,0.0002402238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09327973,0.0001154789,0.904439,0.001114645,0.0001639658,0.0001806798,0.00002446661,0.0001125648,0.0005695097],"genre_scores_gemma":[0.4152308,0.000001155563,0.5830687,0.0008318939,0.0003369878,0.000006235509,0.00007360561,0.00001046536,0.0004400794],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3219511,"threshold_uncertainty_score":0.7715852,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01062748772159976,"score_gpt":0.2626175462694796,"score_spread":0.2519900585478799,"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."}}