{"id":"W2145677964","doi":"","title":"A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron.","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Tetrahedron; Partition (number theory); Combinatorics; Mathematics; Algorithm; Mathematical optimization; Computer science; Convex set; Convex optimization; 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.0006813533,0.001014772,0.001059478,0.001196764,0.0008375911,0.0007697484,0.00148049,0.001609178,0.00309956],"category_scores_gemma":[0.002775263,0.0006126232,0.001095989,0.001308225,0.0009754239,0.000839234,0.001162553,0.001579634,0.0007564613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001064961,"about_ca_system_score_gemma":0.001574028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005826775,"about_ca_topic_score_gemma":0.004779457,"domain_scores_codex":[0.9996319,0.00008009043,0.00001574597,0.00008454655,0.0001427459,0.00004497141],"domain_scores_gemma":[0.9994831,0.0002883683,0.00004876175,0.00004960698,0.00009862176,0.00003152869],"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.00006080056,0.0000855028,0.0006160483,0.0001187887,0.00006586521,0.0001259495,0.000154809,0.8163257,0.005417235,0.03252399,0.004544535,0.1399608],"study_design_scores_gemma":[0.00002970372,0.00004110293,0.0001109635,0.00002289899,0.00001691086,0.00005505239,0.00002438905,0.9827085,0.001052612,0.01237657,0.003549683,0.00001163374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006773816,0.0002292493,0.989318,0.0001095787,0.00005350852,0.00009545877,0.00005386733,0.0003222299,0.003044227],"genre_scores_gemma":[0.089257,0.0003531993,0.9060994,0.0001103235,0.00002963086,0.0004680972,0.0002636327,0.000147757,0.003270824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005826775,"threshold_uncertainty_score":0.01158571,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0257945182085321,"score_gpt":0.2495050461420711,"score_spread":0.223710527933539,"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."}}