{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005575438,0.001140242,0.001282835,0.001684328,0.0007118664,0.001309694,0.002881414,0.001282953,0.01294076],"category_scores_gemma":[0.003020341,0.0007301668,0.001337474,0.002758008,0.0005866267,0.002805877,0.00267391,0.001717101,0.006576615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007563983,"about_ca_system_score_gemma":0.001647795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005511223,"about_ca_topic_score_gemma":0.008857844,"domain_scores_codex":[0.9986081,0.0001274384,0.0001114996,0.0002699905,0.0006939057,0.0001891461],"domain_scores_gemma":[0.9987047,0.0002227316,0.00005591603,0.0005359183,0.0004276362,0.00005310031],"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.0003026616,0.0001841197,0.0008176759,0.0002812681,0.00007749965,0.0001944206,0.0002254787,0.02023381,0.04519541,0.02041941,0.02055592,0.8915123],"study_design_scores_gemma":[0.0005707188,0.0004509818,0.002051743,0.00009658677,0.000282006,0.001797276,0.0001554812,0.7213666,0.04978485,0.06109791,0.1621391,0.000206775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004728807,0.0001860029,0.9864329,0.0001154978,0.0001205356,0.000120957,0.0001820529,0.005336817,0.002776524],"genre_scores_gemma":[0.02398697,0.00009935327,0.9702364,0.00008545157,0.00003316366,0.0001526113,0.0008346067,0.0004893254,0.004082111],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01294076,"threshold_uncertainty_score":0.04329115,"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."}}