{"id":"W1525670588","doi":"","title":"Convex hull covering of polygonal scenes for accurate collision detection in games","year":2008,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Convex hull; Convex set; Polyhedron; Convex polytope; Collision detection; Regular polygon; Subderivative; Convex combination; Computer science; Mathematics; Set (abstract data type); Algorithm; Mathematical optimization; Collision; Convex optimization; Combinatorics; 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.0001853734,0.00008019243,0.0001538215,0.000124019,0.00005928586,0.00001792403,0.0002676902,0.00004807203,0.000002622721],"category_scores_gemma":[0.000078932,0.00007370304,0.00003710252,0.0002725623,0.00003233048,0.0002941276,0.0000700187,0.00005129478,0.000004929806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003163429,"about_ca_system_score_gemma":0.00006012231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001267108,"about_ca_topic_score_gemma":0.000007266388,"domain_scores_codex":[0.9992052,0.00002405899,0.0002203386,0.0002121524,0.0001615283,0.0001767162],"domain_scores_gemma":[0.9994603,0.0001719584,0.00008276116,0.0001819643,0.0000667033,0.00003632082],"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.0004783974,0.0008611053,0.06869663,0.0004214271,0.0001261389,0.0002611201,0.01006559,0.4434944,0.2599701,0.01144503,0.002605625,0.2015744],"study_design_scores_gemma":[0.0005393151,0.000125664,0.02824074,0.00003419316,0.000001316776,0.0000425349,0.00002489067,0.8286098,0.141952,0.0002013593,0.0001185003,0.0001097029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2661473,0.0000377596,0.7331706,0.0000594763,0.0002437194,0.0001275745,0.000001679259,0.00005211298,0.0001597295],"genre_scores_gemma":[0.8432209,0.00001073904,0.1565302,0.00004336247,0.00002363917,0.00001135952,8.789955e-7,0.00000434022,0.0001545183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5770736,"threshold_uncertainty_score":0.3005523,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03561981725721963,"score_gpt":0.2674046964321337,"score_spread":0.231784879174914,"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."}}