{"id":"W2138394562","doi":"10.1142/s0218195902000906","title":"AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Subdivision; Tree traversal; Mathematics; Pointer (user interface); Algorithm; Binary logarithm; Running time; Constant (computer programming); Combinatorics; Planar; Graph traversal; Computer science; Computer graphics (images); Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006557059,0.0002471195,0.0002935091,0.0009848403,0.0002543035,0.0005329943,0.001726621,0.0001061395,0.0001054242],"category_scores_gemma":[0.00005332916,0.0002535885,0.0002696848,0.0008027144,0.00006884496,0.001903449,0.00009184434,0.0002458097,0.00003825314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001843121,"about_ca_system_score_gemma":0.0001661093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003092927,"about_ca_topic_score_gemma":9.171345e-7,"domain_scores_codex":[0.9971698,0.00008449508,0.0009221239,0.0004462914,0.001110431,0.0002668785],"domain_scores_gemma":[0.9955058,0.0004775849,0.000748715,0.0003041385,0.002697617,0.0002661676],"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.00002859928,0.0008387784,0.00008006985,0.00001045769,0.0002116717,0.000007946975,0.0002150087,0.09089607,0.001112269,0.0271881,0.000905426,0.8785056],"study_design_scores_gemma":[0.001427126,0.0003343889,0.001034048,0.00001581404,0.00002998741,0.0002598475,0.00003923394,0.9317876,0.0003870779,0.02325021,0.04115685,0.0002778296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003670525,0.0004606841,0.9932886,0.0008445827,0.0008509529,0.0005734011,0.00007981681,0.00008196511,0.00014942],"genre_scores_gemma":[0.4937275,0.00004871458,0.5040851,0.000425673,0.001305705,0.0001109987,0.0001320505,0.00002050175,0.0001438194],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8782278,"threshold_uncertainty_score":0.9999917,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01763196468959343,"score_gpt":0.2942423025839158,"score_spread":0.2766103378943223,"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."}}