{"id":"W2951850611","doi":"","title":"Time-Space Trade-offs for Triangulating a Simple Polygon","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple polygon; Diagonal; Combinatorics; Polygon (computer graphics); Partition (number theory); Workspace; Simple (philosophy); Mathematics; Path (computing); Polygon covering; Space (punctuation); Point (geometry); Shortest path problem; SIMPLE algorithm; Algorithm; Monotone polygon; Computer science; Graph; Geometry; Artificial intelligence; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004468075,0.0002471084,0.0002883629,0.0002721107,0.0001805247,0.0001396609,0.0008741953,0.0002138987,0.00001570217],"category_scores_gemma":[0.0001040972,0.0002990587,0.0002134206,0.0005900227,0.00003818829,0.0003378798,0.0006737008,0.0002323782,0.00004266512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001995613,"about_ca_system_score_gemma":0.0003926391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002775445,"about_ca_topic_score_gemma":0.00001055495,"domain_scores_codex":[0.9984294,0.0001118712,0.0001994217,0.0008527315,0.0001120254,0.0002945505],"domain_scores_gemma":[0.9985725,0.0002153218,0.0002453299,0.0006098717,0.000176634,0.0001803591],"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.0000486929,0.00007111641,0.00004000412,0.00004817012,0.00006210384,0.00002468138,0.000358136,0.9105508,0.0001898515,0.07898329,0.005815335,0.003807811],"study_design_scores_gemma":[0.0007719925,0.00007669644,0.0000991898,0.00002238521,0.0000397987,0.000003304876,0.00002931556,0.9224376,0.0002610388,0.07111226,0.004825376,0.0003210142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1120961,0.00008002015,0.8852116,0.0003603597,0.0004774914,0.0004910491,0.00003305725,0.0002135432,0.001036813],"genre_scores_gemma":[0.9835206,0.000007388914,0.01259835,0.0001110597,0.0003009552,0.000002759565,0.0001430709,0.00001699608,0.003298867],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8726133,"threshold_uncertainty_score":0.9999462,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0924171337344036,"score_gpt":0.2158240879709775,"score_spread":0.1234069542365739,"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."}}