{"id":"W2115043830","doi":"10.1142/s0218195902000724","title":"KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Logarithm; Simple (philosophy); Regular polygon; Plane (geometry); Combinatorics; Certificate; Set (abstract data type); Collision detection; Upper and lower bounds; Collision; Discrete mathematics; Algorithm; Geometry; Computer science; Mathematical analysis","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.001157806,0.0007226536,0.001318697,0.001964486,0.001161017,0.002449434,0.003695103,0.0008306622,0.002967636],"category_scores_gemma":[0.007770008,0.0008549262,0.0009718899,0.002252009,0.002337374,0.006003061,0.004062165,0.001620771,0.0009581421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001020186,"about_ca_system_score_gemma":0.001064958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001536736,"about_ca_topic_score_gemma":0.001126565,"domain_scores_codex":[0.9980405,0.0001905341,0.0001971198,0.0004096963,0.0009074483,0.0002547161],"domain_scores_gemma":[0.9950705,0.001381286,0.0007815876,0.001893515,0.0006179752,0.0002551005],"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.001911782,0.0002284555,0.008733562,0.0006134454,0.00007869928,0.0006832451,0.0008897066,0.3314747,0.04819909,0.3077922,0.005691823,0.2937034],"study_design_scores_gemma":[0.00008561814,0.0002588434,0.0006811159,0.00004540749,0.00003073769,0.0003534661,0.0001617014,0.8227757,0.0480259,0.1189084,0.00858781,0.00008536474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03391059,0.00006627592,0.9631236,0.00009632693,0.00004004922,0.00006701305,0.000266671,0.001376641,0.001052804],"genre_scores_gemma":[0.5627252,0.0001607212,0.4330864,0.00007338872,0.00004670435,0.0002108018,0.001174694,0.0002555189,0.002266488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003695103,"threshold_uncertainty_score":0.00992769,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02142709383042527,"score_gpt":0.2928804251844943,"score_spread":0.271453331354069,"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."}}