{"id":"W2083123226","doi":"10.1016/j.comgeo.2004.01.006","title":"Constructing convex 3-polytopes from two triangulations of a polygon","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Convexity; Polytope; Convex polytope; Triangulation; Convex polygon; Polygon (computer graphics); Regular polygon; Convex set; Linear inequality; Discrete mathematics; Convex optimization; Geometry; Computer science; Inequality; Mathematical analysis","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.0002286519,0.0001670213,0.0002622339,0.0005035411,0.0001636435,0.000104694,0.0004472771,0.00006026991,0.00008608565],"category_scores_gemma":[0.0001661076,0.0001813739,0.0001224835,0.001487546,0.0000961902,0.0005037509,0.0001569453,0.000127321,0.00005502928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009823553,"about_ca_system_score_gemma":0.0003254373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001279182,"about_ca_topic_score_gemma":0.00001032203,"domain_scores_codex":[0.9982928,0.00006112054,0.0005218587,0.0004042676,0.000513548,0.0002063812],"domain_scores_gemma":[0.9984285,0.0005785394,0.0002733865,0.0002713488,0.0003389563,0.0001092309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001044335,0.00007187721,0.001679975,0.000008006835,0.00005914479,0.000004915241,0.0002600629,0.5002986,0.0007010159,0.4607988,0.00005461977,0.03605253],"study_design_scores_gemma":[0.004953313,0.0001537266,0.04587059,0.0000947031,0.00004050205,0.00008218123,0.0002745845,0.3107066,0.01391135,0.6228198,0.0004819727,0.0006105988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2938764,0.0003067307,0.7037917,0.0006426079,0.0004179281,0.0001186857,0.00004051181,0.00009174763,0.0007137042],"genre_scores_gemma":[0.7268426,0.00000198641,0.2725997,0.0001809203,0.0001761759,0.000004664379,0.0001584457,0.000007171443,0.00002834156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4329662,"threshold_uncertainty_score":0.7396214,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01620979012889884,"score_gpt":0.2649718706669065,"score_spread":0.2487620805380077,"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."}}