{"id":"W2158382416","doi":"10.4230/lipics.swat.2016.30","title":"Time-Space Trade-offs for Triangulating a Simple Polygon","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Simple polygon; Workspace; Simple (philosophy); Polygon (computer graphics); Combinatorics; Binary logarithm; Space (punctuation); Computer science; SIMPLE algorithm; Algorithm; Mathematics; Time complexity; Monotone polygon; Discrete mathematics; Artificial intelligence; Geometry; Physics; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.003606614,0.001031173,0.001267692,0.0009339832,0.001156782,0.002009082,0.00295754,0.001788952,0.01213405],"category_scores_gemma":[0.01896731,0.0007877305,0.001305231,0.001937302,0.00168473,0.005888428,0.003077686,0.00103369,0.002615746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001443381,"about_ca_system_score_gemma":0.00191563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001189857,"about_ca_topic_score_gemma":0.002946356,"domain_scores_codex":[0.9955904,0.00158318,0.0003816136,0.0008168563,0.001046086,0.0005818719],"domain_scores_gemma":[0.9842811,0.01071615,0.0008292932,0.002838037,0.0007603405,0.000575142],"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.007142662,0.0005781202,0.003877767,0.0008726045,0.0001624609,0.0004522801,0.0005953944,0.4338493,0.03753599,0.06523236,0.01739139,0.4323097],"study_design_scores_gemma":[0.0004515727,0.000632834,0.0007400111,0.0000599339,0.00007185925,0.0002842086,0.0002229802,0.9169368,0.01864877,0.05886497,0.00303785,0.00004821739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3586077,0.002315657,0.600341,0.003075502,0.0002628327,0.0002907623,0.0007624439,0.008454625,0.02588949],"genre_scores_gemma":[0.6426026,0.0006061044,0.3487332,0.0002644535,0.0001093227,0.0003313278,0.001155556,0.001203196,0.004994266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01213405,"threshold_uncertainty_score":0.04059243,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01555628448711917,"score_gpt":0.2561525916758043,"score_spread":0.2405963071886851,"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."}}