{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003497717,0.0001502661,0.0001989761,0.0007432283,0.0001774213,0.0002158015,0.001316696,0.0000703375,0.00003989432],"category_scores_gemma":[0.000129181,0.000152592,0.0001885089,0.0007334519,0.00004885807,0.0005132867,0.0001035955,0.0001845314,0.0000659455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001656056,"about_ca_system_score_gemma":0.00007041714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004655879,"about_ca_topic_score_gemma":4.196474e-7,"domain_scores_codex":[0.9979323,0.00004152311,0.0006897144,0.0002592529,0.0008763531,0.0002009131],"domain_scores_gemma":[0.9966516,0.0007344501,0.0006015099,0.0002143225,0.001655577,0.000142527],"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.00002883998,0.0005568329,0.0002950453,0.0000168203,0.0002767033,0.00001739072,0.0002083988,0.6195251,0.0007695527,0.02845239,0.004208201,0.3456448],"study_design_scores_gemma":[0.001454407,0.0002681026,0.003589046,0.0000342629,0.00003757374,0.0007512062,0.00003385891,0.8130897,0.0009698503,0.07080266,0.1086708,0.0002984512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001905738,0.000319135,0.9947546,0.001614631,0.0006251941,0.0003651771,0.00004060418,0.00006088408,0.0003140805],"genre_scores_gemma":[0.6150868,0.00002332804,0.3836149,0.0003068619,0.0007092993,0.0001001885,0.00002581417,0.00001379169,0.0001190507],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6131811,"threshold_uncertainty_score":0.6222519,"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."}}