与楼梯护栏连接的网格障碍表示
Grid-Obstacle Representations with Connections to Staircase Guarding
摘要:
在本文中,我们研究了图的网格障碍表示,我们分配的网格点的顶点和定义的障碍,使得边存在的当且仅当一个$xy$ -单调网格路径连接两个端点,而不会遇到障碍或另一个顶点。以前有人认为,所有平面图在2D中具有网格障碍表示,并且所有图在3D中具有网格障碍表示。在本文中,我们表明,这样的建设是可能的,明显小于以前实现的网格大小。然后,我们研究的变种,顶点不阻塞,并表明,然后网格障碍表示存在的二分图。后者有所谓的楼梯守卫的正交多边形的应用程序,使用我们的网格障碍表示,我们表明,楼梯守卫是\textsc{NP} -硬在2D。
英文摘要:
In this paper, we study grid-obstacle representations of graphs where we assign grid-points to vertices and define obstacles such that an edge exists if and only if an $xy$-monotone grid path connects the two endpoints without hitting an obstacle or another vertex. It was previously argued that all planar graphs have a grid-obstacle representation in 2D, and all graphs have a grid-obstacle representation in 3D. In this paper, we show that such constructions are possible with significantly smaller grid-size than previously achieved. Then we study the variant where vertices are not blocking, and show that then grid-obstacle representations exist for bipartite graphs. The latter has applications in so-called staircase guarding of orthogonal polygons; using our grid-obstacle representations, we show that staircase guarding is \textsc{NP}-hard in 2D.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。