{"id":"W2296549964","doi":"10.4230/lipics.socg.2015.719","title":"Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Deterministic algorithm; Computational geometry; Algorithm; Voronoi diagram; Combinatorics; Mathematics; Time complexity; Regular polygon; Dynamic programming; Randomized algorithm; Linear programming; Approximation algorithm; Mathematical optimization; Computer science; Geometry","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.00139955,0.00128287,0.001552681,0.0012045,0.001297737,0.002210984,0.003052979,0.001827285,0.01044427],"category_scores_gemma":[0.007954277,0.001174583,0.002198037,0.002017564,0.001455201,0.003494218,0.00428244,0.00226813,0.002309734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002390318,"about_ca_system_score_gemma":0.002496128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00358453,"about_ca_topic_score_gemma":0.006978776,"domain_scores_codex":[0.9978889,0.0003448903,0.0002040431,0.0005219411,0.0006645594,0.0003756659],"domain_scores_gemma":[0.9952583,0.002400568,0.0003692613,0.001327492,0.000457727,0.0001867437],"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.0004636951,0.0002188489,0.001476012,0.0005223179,0.00007442643,0.00009135385,0.0002291275,0.4397383,0.006674679,0.1653202,0.01251194,0.3726791],"study_design_scores_gemma":[0.000109154,0.00009158828,0.0003012461,0.00004127613,0.00003631956,0.00009544023,0.0000719301,0.8265741,0.003669786,0.162186,0.006789104,0.00003409253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0109305,0.0002517407,0.9832181,0.0002387845,0.00005425466,0.00009312348,0.0002269541,0.0009539272,0.004032724],"genre_scores_gemma":[0.1149838,0.0002716216,0.8798372,0.0001507037,0.00003602252,0.0002873937,0.000825941,0.0003737592,0.003233486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01044427,"threshold_uncertainty_score":0.03493953,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04233832791099378,"score_gpt":0.2922397059483311,"score_spread":0.2499013780373373,"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."}}