{"id":"W2282988760","doi":"10.1007/s00454-016-9784-4","title":"Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings","year":2016,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computational geometry; Combinatorics; Deterministic algorithm; Algorithm; Regular polygon; Voronoi diagram; Convex geometry; Geometry; Convex optimization; Convex set","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.0003639614,0.0002184345,0.0002107712,0.0003318005,0.0002807915,0.0002171218,0.0003993655,0.00007289747,0.00002365587],"category_scores_gemma":[0.0002010923,0.0001725945,0.0001054759,0.0004882645,0.00009077775,0.0006231417,0.0001951723,0.00006367979,0.00003293962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004709339,"about_ca_system_score_gemma":0.0001142993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002379436,"about_ca_topic_score_gemma":7.166186e-7,"domain_scores_codex":[0.9982092,0.00004399618,0.0003618681,0.0006313466,0.0004113417,0.0003422656],"domain_scores_gemma":[0.9981745,0.001009793,0.0001449963,0.0002137097,0.0002804894,0.0001764968],"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.00007740068,0.0001453351,0.001865082,0.00009552539,0.0001451396,0.00002207502,0.0004454828,0.04548059,0.001586174,0.3350514,0.00195783,0.6131279],"study_design_scores_gemma":[0.001935548,0.0004129836,0.03056624,0.00007160665,0.00002635049,0.0001267627,0.00002176595,0.879228,0.0004770694,0.07636782,0.0101424,0.000623431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0866626,0.0001534983,0.9102457,0.002078994,0.0002854914,0.0002599715,0.00004544394,0.0001292927,0.0001390243],"genre_scores_gemma":[0.6296576,0.000007797455,0.3691484,0.0004565724,0.0001976228,0.00004967587,0.00004988119,0.0000138331,0.0004186243],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8337474,"threshold_uncertainty_score":0.70382,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.019191564393856,"score_gpt":0.279467088473464,"score_spread":0.260275524079608,"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."}}