{"id":"W4301413600","doi":"10.20382/jocg.v5i1a1","title":"Unions of onions: preprocessing imprecise points for fast onion decomposition","year":2014,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Decomposition; Combinatorics; Mathematics; Matching (statistics); Disjoint union (topology); Binary logarithm; Time complexity; Regular polygon; Set (abstract data type); Point (geometry); Data structure; Discrete mathematics; Unit disk; Computer science; Chemistry; Statistics; Geometry","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001043256,0.0003382529,0.0006898478,0.002881485,0.0002704721,0.0001905266,0.001328906,0.0002922415,0.00001384557],"category_scores_gemma":[0.0003093706,0.0003836446,0.0005982803,0.00141908,0.00009077283,0.0008679348,0.0005006448,0.0005336505,0.000003224757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003593306,"about_ca_system_score_gemma":0.001399414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006803937,"about_ca_topic_score_gemma":0.000002306944,"domain_scores_codex":[0.9969966,0.0002825182,0.00101832,0.0005239077,0.0009060115,0.0002725967],"domain_scores_gemma":[0.9929143,0.001006719,0.002347205,0.0003742673,0.003086088,0.0002713991],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001539158,0.0002883981,0.000105362,0.0002968168,0.0002410777,0.00001181984,0.0002222084,0.9487428,0.0005309502,0.02690605,0.000973956,0.02152666],"study_design_scores_gemma":[0.004977685,0.001392909,0.005505126,0.001835127,0.0004984897,0.0003181903,0.0002204776,0.774337,0.005354456,0.1849324,0.01940188,0.001226301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07442898,0.0002366387,0.9221187,0.001023441,0.001319582,0.0003419839,0.00009001214,0.00004302667,0.0003976133],"genre_scores_gemma":[0.7167227,0.00005999158,0.2822886,0.0001543855,0.0003865053,0.000001539108,0.0001868789,0.00002041672,0.000178972],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6422938,"threshold_uncertainty_score":0.9998615,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01515668206177541,"score_gpt":0.2662926280989182,"score_spread":0.2511359460371428,"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."}}