{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002974482,0.0009826861,0.001116444,0.0009290166,0.00110964,0.001739061,0.003068941,0.001591584,0.01343891],"category_scores_gemma":[0.01659766,0.0007991091,0.001418942,0.001965961,0.001475651,0.005093329,0.003187501,0.001020782,0.002808382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001505074,"about_ca_system_score_gemma":0.002043351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002029742,"about_ca_topic_score_gemma":0.005216077,"domain_scores_codex":[0.9961663,0.001288612,0.000326215,0.0007581646,0.0009671845,0.0004934466],"domain_scores_gemma":[0.986482,0.008506833,0.000720023,0.003101419,0.0006786249,0.0005110034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005180214,0.0004728481,0.004199952,0.000798592,0.0001623668,0.0003977503,0.0005060362,0.4139121,0.02785223,0.05060256,0.02437471,0.4715407],"study_design_scores_gemma":[0.0003436581,0.0003832302,0.0007062591,0.000050383,0.00005701192,0.0002096703,0.0001862777,0.9380999,0.01386761,0.0427471,0.003314389,0.00003452271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2839387,0.001720458,0.6679949,0.003305017,0.0002919114,0.0003329806,0.001092618,0.01224847,0.02907498],"genre_scores_gemma":[0.5850153,0.0004040159,0.4055853,0.0003097234,0.00009743528,0.0003347973,0.001427402,0.001459868,0.005366128],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01343891,"threshold_uncertainty_score":0.04495764,"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."}}