{"id":"W2393386409","doi":"","title":"An Algorithm for Rapidly Computing the Minimum Distance Between Two Objection Collision Detection","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Simulation and Modeling Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Collision detection; Algorithm; Collision; Point (geometry); Set (abstract data type); Feature (linguistics); Mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001183969,0.001615906,0.001994765,0.003198181,0.001522216,0.001567277,0.003198408,0.001414152,0.00375854],"category_scores_gemma":[0.004092712,0.0009781631,0.000995828,0.002675022,0.0008011716,0.002423591,0.002361523,0.001714207,0.001501047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001023213,"about_ca_system_score_gemma":0.00230467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004567971,"about_ca_topic_score_gemma":0.004118307,"domain_scores_codex":[0.9981219,0.0001985199,0.0001733831,0.0003745276,0.0009666749,0.0001650547],"domain_scores_gemma":[0.998228,0.0005120508,0.0001618381,0.0002048291,0.000807219,0.00008610122],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00043054,0.0001436224,0.001703774,0.0003001663,0.0001611564,0.000274046,0.0002974434,0.0639664,0.03429538,0.0163875,0.007044259,0.8749956],"study_design_scores_gemma":[0.0002189457,0.0003106236,0.001353592,0.00004080226,0.00009950942,0.001047579,0.000141841,0.9302265,0.03806435,0.01211753,0.0162467,0.0001319181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002603974,0.0001405007,0.9961007,0.00003090054,0.00003974275,0.00005405111,0.00002068474,0.0007136452,0.0002957821],"genre_scores_gemma":[0.03118106,0.0001334751,0.967297,0.00003340313,0.00002405742,0.0001651598,0.0001521966,0.00007566204,0.0009379874],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004567971,"threshold_uncertainty_score":0.0125736,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01516823087064767,"score_gpt":0.267104343022936,"score_spread":0.2519361121522883,"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."}}