最小封堵圈的扩张算法设计  

The Expansion Algorithm Design of the Smallest Encirclement

作　　者：董小小[1] 唐棣[1] 魏歆[1] 罗万春[2] 

机构地区：[1]第三军医大学研究生管理大队,重庆400038 [2]第三军医大学数学与生物数学教研室,重庆400038

出　　处：《数学的实践与认识》2014年第11期185-190,共6页Mathematics in Practice and Theory

基　　金：全国大学生数学建模赛题后续研究立项课题(B1129)

摘　　要：在发生突发事件之后,及时制定有效的封堵方案才能掌握抓捕嫌疑犯的主动权.提出了对逃跑罪犯实施完全封堵的最小包围圈的计算机算法,通过规则图形的仿真演示,验证了该算法的正确性.最后以某市案发时候的警力分布和交通图作为实例,模拟了对嫌疑犯实施封堵时计算最小包围圈的最优方案.结果证明该算法具有简洁、可靠的优点.In the emergencies, only timely making an effective plan of encircling the suspect,can we have the initiative in hands. This paper has proposed a computerized algorithm ofencircling the suspect with smallest encirclement. Then a rectangle map has been used forthe simulation test, which has demonstrated the correctness of the algorithm. More over theroad map of a certain city and the distribution of the police on that time has been taken as anexample to simulate the process of finding the smallest encirclement in chasing the suspect,FinMly, the satisfactory result proves the algorithm is concise and reliable.

关 键 词：最小封堵圈 FLOYD算法 嫌疑犯 

分 类 号：O157.5[理学—数学]