{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004375646,0.001404799,0.001520492,0.001819915,0.0009312073,0.001466291,0.002930724,0.001339629,0.02352653],"category_scores_gemma":[0.001644565,0.0009297219,0.00130759,0.002832833,0.0006460158,0.002396457,0.002736528,0.001922107,0.007972362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008204065,"about_ca_system_score_gemma":0.001408401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0060218,"about_ca_topic_score_gemma":0.01034932,"domain_scores_codex":[0.9990366,0.00008319588,0.00007585836,0.000179729,0.0004896502,0.0001350776],"domain_scores_gemma":[0.9989723,0.0001975635,0.00003125803,0.0004199365,0.0003262491,0.0000527208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005035228,0.0002232057,0.0003662212,0.0002580429,0.00006814346,0.0001580728,0.0002173461,0.0153998,0.06237759,0.02302771,0.02395656,0.8734438],"study_design_scores_gemma":[0.0005371033,0.0004385434,0.001518269,0.00007738725,0.0002662472,0.001136777,0.0001619584,0.7730435,0.0665355,0.04676282,0.1093466,0.0001752602],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007413194,0.0001731556,0.9794914,0.0001073895,0.0002209596,0.0001210444,0.0002044396,0.006463767,0.005804567],"genre_scores_gemma":[0.025424,0.00009506405,0.9631757,0.00007885883,0.00004480049,0.0001294556,0.0006683512,0.0007703967,0.009613346],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02352653,"threshold_uncertainty_score":0.07870406,"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."}}