{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007131734,0.0003213887,0.0003625904,0.0002924496,0.0004252728,0.0003240913,0.000779191,0.0001629033,0.00003197046],"category_scores_gemma":[0.0002688532,0.0002463389,0.0002943394,0.0004085324,0.00006057976,0.001912137,0.0002089881,0.0001157566,0.0001142058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001277039,"about_ca_system_score_gemma":0.0001241726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002949945,"about_ca_topic_score_gemma":0.000004271317,"domain_scores_codex":[0.9976388,0.00003912323,0.0008942349,0.0003335944,0.0004226689,0.0006715811],"domain_scores_gemma":[0.9980222,0.0005912333,0.0004155351,0.0005602741,0.0002077169,0.0002030476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005654218,0.0007622695,0.0007939392,0.0007813868,0.0004615069,0.000005316426,0.01404838,0.003497198,0.0120418,0.1414737,0.07584801,0.7497211],"study_design_scores_gemma":[0.00898086,0.0007222684,0.0005977314,0.0001625992,0.00004590166,0.00006009652,0.0002325142,0.6519787,0.01394986,0.009175235,0.3131567,0.0009375693],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05237209,0.00003536757,0.9418225,0.002425447,0.000656458,0.001286277,0.0003370657,0.000253171,0.0008116724],"genre_scores_gemma":[0.8174745,0.00001187414,0.1770456,0.001678274,0.0007226305,0.0003335155,0.0005123139,0.00005960408,0.002161662],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7651024,"threshold_uncertainty_score":0.9999989,"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."}}