{"id":"W1995123299","doi":"10.1007/s00454-001-0045-8","title":"Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes","year":2001,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Polytope; Mathematics; Triangulation; Point set triangulation; Convex polytope; Regular polygon; Tetrahedron; Minimum-weight triangulation; Pitteway triangulation; Delaunay triangulation; Discrete mathematics; Convex set; Bowyer–Watson algorithm; Convex optimization; Geometry","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":[],"consensus_categories":[],"category_scores_codex":[0.0004089132,0.0001961564,0.0002949487,0.000578649,0.0002441299,0.0001161449,0.0004488998,0.00009113154,0.00005604584],"category_scores_gemma":[0.0002139234,0.0002047012,0.000196618,0.001503017,0.0000660908,0.0006283848,0.0001028405,0.00008205815,0.00001933879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004650402,"about_ca_system_score_gemma":0.0001737282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009269034,"about_ca_topic_score_gemma":0.000002451189,"domain_scores_codex":[0.9980716,0.00006827962,0.0006263599,0.0004392012,0.0005223592,0.0002722467],"domain_scores_gemma":[0.9980837,0.0006622609,0.0003174811,0.0002714799,0.0005588109,0.0001062557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001122772,0.0002337969,0.001200652,0.00006783124,0.0001064759,0.000002436824,0.0004779076,0.4309294,0.001454568,0.4941959,0.001669626,0.0695491],"study_design_scores_gemma":[0.001255137,0.0001775779,0.0220441,0.0000186681,0.00002353746,0.00002197698,0.00005407613,0.8878465,0.0008578839,0.08414783,0.00326622,0.000286499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09772447,0.0001364587,0.8992411,0.000954901,0.0003883856,0.0005074906,0.00005799417,0.00009884156,0.0008903157],"genre_scores_gemma":[0.8660393,0.000005215896,0.1326342,0.0002680316,0.0002620889,0.00006240616,0.0005022358,0.00001316919,0.0002132964],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7683148,"threshold_uncertainty_score":0.8347471,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02284653247770731,"score_gpt":0.2893487290770637,"score_spread":0.2665021965993564,"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."}}