{"id":"W2141565952","doi":"10.1145/2229163.2229173","title":"Entropy, triangulation, and point location in planar subdivisions","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Division of Computing and Communication Foundations; Office of International Science and Engineering","keywords":"Point location; Subdivision; Triangulation; Data structure; Point (geometry); Upper and lower bounds; Preprocessor; Distribution (mathematics); Computational geometry","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":[],"consensus_categories":[],"category_scores_codex":[0.000305744,0.0001014131,0.00009559184,0.0003162771,0.0001534733,0.00006102435,0.0001744455,0.0000537161,0.0000264023],"category_scores_gemma":[0.0000435465,0.0001018159,0.00002898651,0.0007196615,0.00001854526,0.0007537555,0.000007177843,0.0001175607,0.0000522526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005668358,"about_ca_system_score_gemma":0.00003460837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002830492,"about_ca_topic_score_gemma":0.00001645132,"domain_scores_codex":[0.9991101,0.0000713029,0.0002083061,0.0002142509,0.0001981236,0.0001978939],"domain_scores_gemma":[0.9993056,0.0001780315,0.00004242124,0.0003074082,0.00006023773,0.000106277],"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.00001831937,0.000475182,0.0005223069,0.00001118253,0.00002238783,0.000002398382,0.001580881,0.01700767,0.0006553419,0.03228733,0.000183307,0.9472337],"study_design_scores_gemma":[0.004190402,0.0005896067,0.3110359,0.00009607735,0.00005073568,0.0001640239,0.0003071478,0.5983257,0.01115026,0.06437156,0.008688271,0.001030256],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01850197,0.0002005603,0.9782203,0.002352505,0.0004252461,0.0001717306,0.000004219169,0.0000682203,0.00005523932],"genre_scores_gemma":[0.8838943,0.00003580345,0.1156315,0.0001759013,0.00007671224,0.00002780015,0.00001105404,0.000005516303,0.0001413721],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9462034,"threshold_uncertainty_score":0.4151931,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02101595205208065,"score_gpt":0.2642363237849514,"score_spread":0.2432203717328708,"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."}}