给定一个平面图集合$G_1,\dots,G_k$在同一个$n$顶点集合$V$上,同时几何嵌入(带映射)问题,或者简称为$k$,是要找到平面中$n$点的集合$P$和一个双射$ϕ: V \to P$,使得$ϕ$下的$G_1,\dots,G_k$的导出直线图都是平面。这个问题是多项式时间等价于抽象拓扑图的弱直线可实现性,Kynčl(doi:10.1007/s 00454 -010-9320-x)证明了它对于实的存在理论$\exists\mathbb{R}$是完备的。因此,问题$k$ -SGE是多项式时间等价于计算几何中的其他几个问题,如识别线段的相交图或寻找图的直线交叉数。我们给出了从伪线可拉伸性问题到$k$ -SGE的一个初等约化,其性质是$k$和$n$都与伪线的个数成线性关系.这不仅意味着$\exists\mathbb{R}$ -硬度结果,而且还意味着可以在其上绘制任何此类同时嵌入的网格的最小大小的$2^{2^{Ω(n)}}$下限。这个界限很紧.因此,存在可以同时嵌入的图的集合,但是每个同时绘制需要每个坐标的指数数量的位。从Kynčl的证明中可以提取的最佳值只有$2^{2^{Ω(\sqrt{n})}}$。
英文摘要:
Given a collection of planar graphs $G_1,\dots,G_k$ on the same set $V$ of $n$ vertices, the simultaneous geometric embedding (with mapping) problem, or simply $k$-SGE, is to find a set $P$ of $n$ points in the plane and a bijection $ϕ: V \to P$ such that the induced straight-line drawings of $G_1,\dots,G_k$ under $ϕ$ are all plane.
This problem is polynomial-time equivalent to weak rectilinear realizability of abstract topological graphs, which Kynčl (doi:10.1007/s00454-010-9320-x) proved to be complete for $\exists\mathbb{R}$, the existential theory of the reals. Hence the problem $k$-SGE is polynomial-time equivalent to several other problems in computational geometry, such as recognizing intersection graphs of line segments or finding the rectilinear crossing number of a graph.
We give an elementary reduction from the pseudoline stretchability problem to $k$-SGE, with the property that both numbers $k$ and $n$ are linear in the number of pseudolines. This implies not only the $\exists\mathbb{R}$-hardness result, but also a $2^{2^{Ω(n)}}$ lower bound on the minimum size of a grid on which any such simultaneous embedding can be drawn. This bound is tight. Hence there exists such collections of graphs that can be simultaneously embedded, but every simultaneous drawing requires an exponential number of bits per coordinates. The best value that can be extracted from Kynčl's proof is only $2^{2^{Ω(\sqrt{n})}}$.
Geometric Embedding of Path and Cycle Graphs in Pseudo-convex Polygons
给定一个图$ G $,图中有$ n $顶点和平面上的$ n $点的集合$ S $,$ G $在$ S $上的点集嵌入是一个平面图,使得$ G $的每个顶点映射到$ S $的一个不同点。直线点集嵌入是没有边折弯或曲线的点集嵌入。即使当$ G $是$ 2 $ -连通和$ 2 $ -外平面的时,点集的可嵌入性问题也是NP完全的.它已经解决了多项式只有少数几类平面图。假设$ S $是一个简单多边形的顶点集。图的直线多边形嵌入是指图在多边形顶点上的直线点集嵌入,且图的边与多边形的边不相交。本文给出了简单凸多边形中路径图和圈图的多边形嵌入的$ O(n) $ -时间算法和一类简单多边形中路径图和圈图的多边形嵌入的同样的时间算法,其中$n$是多边形的顶点数.
Concept2Box: Joint Geometric Embeddings for Learning Two-View Knowledge Graphs
University of California, Los Angeles(加州大学洛杉矶分校);Amazon.com Inc(亚马逊公司);University of California, San Diego(加州大学圣地亚哥分校);Carnegie Mellon University(卡内基梅隆大学)