{"id":"W2100819154","doi":"10.1109/cgi.1997.601259","title":"An algorithm for polygon subdivision based on vertex normals","year":2002,"lang":"en","type":"article","venue":"","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Polygon (computer graphics); Rendering (computer graphics); Polygon mesh; Point in polygon; Computer science; Rectilinear polygon; Vertex (graph theory); Triangle mesh; Polygon covering; Surface triangulation; Subdivision surface; Mathematics; Algorithm; Monotone polygon; Computer graphics (images); Simple polygon; Combinatorics; Geometry; Delaunay triangulation; Constrained Delaunay triangulation; Graph","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.0007679837,0.0009233011,0.001135758,0.001705366,0.00090326,0.002187319,0.002050772,0.0008566615,0.007711715],"category_scores_gemma":[0.002759564,0.0006485346,0.001026917,0.001272384,0.0009784885,0.001423677,0.002220073,0.001617034,0.00345978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009275414,"about_ca_system_score_gemma":0.00131244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0048975,"about_ca_topic_score_gemma":0.005210683,"domain_scores_codex":[0.9990367,0.00007333027,0.00006262863,0.0001682168,0.000571951,0.00008730778],"domain_scores_gemma":[0.99927,0.0001709842,0.0000376224,0.000174601,0.0003003749,0.00004637854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002753091,0.00007185264,0.0007932013,0.0001885239,0.00004421877,0.0001332887,0.0005048117,0.05778676,0.03672442,0.05610314,0.0100082,0.8373663],"study_design_scores_gemma":[0.0001187773,0.0001266695,0.0004213483,0.00005474523,0.0000376745,0.0003144769,0.0001513835,0.8494406,0.0322403,0.04715955,0.06987265,0.00006194833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00204923,0.00005463054,0.9942309,0.00003479078,0.00006257099,0.0000863478,0.00003898159,0.001968952,0.001473583],"genre_scores_gemma":[0.03608715,0.0001271451,0.9587368,0.00002852105,0.00002781873,0.0001722582,0.0003328493,0.0006641384,0.003823327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007711715,"threshold_uncertainty_score":0.02579826,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02591556241627152,"score_gpt":0.2943770215403298,"score_spread":0.2684614591240583,"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."}}