直线多边形的疏散
Evacuation of rectilinear polygons
摘要:
我们调查的问题,创建快速疏散计划的建筑物,被建模为网格多边形,可能包含指数许多细胞。我们研究这个问题在两个方面:“汇合”的情况下,出口的路线保持固定的时间,和“非汇合”的情况下,路线可能会改变。合流疏散计划更容易执行,因为它们将相邻区域分配给出口;非合流分配可能会创建更快的疏散计划。我们给出了创建疏散计划的难度和强多项式算法,当建筑物有两个出口时,找到合流疏散计划的结果。对于非融合疏散方案,我们给出了一个伪多项式时间算法。最后,我们证明了融合计划和非融合计划之间的最坏情况界是2-2/(k+1)。
英文摘要:
We investigate the problem of creating fast evacuation plans for buildings that are modeled as grid polygons, possibly containing exponentially many cells. We study this problem in two contexts: the ``confluent'' context in which the routes to exits remain fixed over time, and the ``non-confluent'' context in which routes may change. Confluent evacuation plans are simpler to carry out, as they allocate contiguous regions to exits; non-confluent allocation can possibly create faster evacuation plans. We give results on the hardness of creating the evacuation plans and strongly polynomial algorithms for finding confluent evacuation plans when the building has two exits. We also give a pseudo-polynomial time algorithm for non-confluent evacuation plans. Finally, we show that the worst-case bound between confluent and non-confluent plans is 2-2/(k+1).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。