{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006825894,0.001278842,0.001691754,0.001493319,0.0008591216,0.001877576,0.001786923,0.001753322,0.007721631],"category_scores_gemma":[0.004057717,0.001509447,0.002049574,0.001549861,0.001351714,0.001428699,0.004482602,0.002875312,0.00173706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007383859,"about_ca_system_score_gemma":0.0008883826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00262624,"about_ca_topic_score_gemma":0.003728435,"domain_scores_codex":[0.9991738,0.0001454997,0.00005444446,0.0001239134,0.0004009281,0.0001014014],"domain_scores_gemma":[0.9987321,0.0006402002,0.0001120801,0.0002506142,0.0001565509,0.0001083811],"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.0007388489,0.0003702106,0.002315549,0.001061585,0.000188996,0.001823453,0.001276321,0.575363,0.03346148,0.1120134,0.008234504,0.2631527],"study_design_scores_gemma":[0.0001084534,0.0001564744,0.0005080379,0.000106026,0.00004084185,0.0003569542,0.0004892756,0.9261121,0.01059415,0.05124207,0.01023011,0.00005553993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04677233,0.000112976,0.9445894,0.0001547702,0.00007829829,0.0002742586,0.0003747481,0.0007358296,0.006907418],"genre_scores_gemma":[0.1819793,0.0002174356,0.8135538,0.0000495163,0.00001653623,0.0002670125,0.0007822682,0.0004382611,0.002695939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007721631,"threshold_uncertainty_score":0.02583146,"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."}}