{"id":"W1958941591","doi":"10.1007/3-540-40996-3_38","title":"An Improved Algorithm for Subdivision Traversal without Extra Storage","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Subdivision; Tree traversal; Computer science; Pointer (user interface); Algorithm; Running time; Planar; Constant (computer programming); Graph traversal; Computer graphics (images); Artificial intelligence; Programming language","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.0008801362,0.000513199,0.0004570156,0.0008306137,0.000382804,0.0007246503,0.002249019,0.0003186084,0.00003249964],"category_scores_gemma":[0.00002504312,0.0004983764,0.000157552,0.0005102323,0.0002697097,0.001082734,0.0002517938,0.0004672274,0.00001747495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002267939,"about_ca_system_score_gemma":0.0006400991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001394879,"about_ca_topic_score_gemma":0.00003007081,"domain_scores_codex":[0.9963468,0.00004045603,0.000497259,0.001716328,0.0008016906,0.0005974247],"domain_scores_gemma":[0.9979025,0.0002963072,0.0002253857,0.001031286,0.0002996353,0.0002449452],"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.000008918367,0.00004009757,0.000001875072,0.00001024888,0.000006428773,0.00001115722,0.0002991901,0.04929025,0.0003582232,0.00378577,0.000009845456,0.946178],"study_design_scores_gemma":[0.0004488794,0.0005061606,0.0000605782,0.00007061179,0.000008529627,0.00003840743,1.011825e-7,0.9236912,0.001176063,0.07134885,0.002091098,0.0005595852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000153628,0.000208672,0.9963831,0.0001442719,0.001726488,0.0007293665,0.00002462416,0.0001814617,0.0004484408],"genre_scores_gemma":[0.06685667,0.00002884491,0.9306918,0.0008269984,0.001073321,0.00002370834,0.0000667281,0.00004106576,0.0003908395],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9456184,"threshold_uncertainty_score":0.9997468,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01424540406648586,"score_gpt":0.258003894340457,"score_spread":0.2437584902739711,"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."}}