最小封堵圈的扩张算法设计
Mathematics in Practice and Theory（2014）
Abstract
在发生突发事件之后,及时制定有效的封堵方案才能掌握抓捕嫌疑犯的主动权.提出了对逃跑罪犯实施完全封堵的最小包围圈的计算机算法,通过规则图形的仿真演示,验证了该算法的正确性.最后以某市案发时候的警力分布和交通图作为实例,模拟了对嫌疑犯实施封堵时计算最小包围圈的最优方案.结果证明该算法具有简洁、可靠的优点.
MoreKey words
smallest encirclement,floyd algorithm,chasing the suspect
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined