arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.4299cs.CGcs.CCcs.DMcs.DS
收藏

均匀小面平面嵌入

Planar Embeddings with Small and Uniform Faces

Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter

摘要:

出于寻找平面嵌入,导致良好的美学图纸,我们研究的问题MINMAXFACE和嵌入一个给定的双连通多重图,使最大的脸是尽可能小的,使所有的面具有相同的大小,分别MINMAXFACE和MINMAXORMFACES。我们证明了一个复杂性二分法MINMAXFACE,并表明,决定是否最大是至多$k$是多项式时间可解的$k \leq 4$和NP-完全$k \geq 5$。此外,我们给出了一个6-近似最小化平面嵌入中的最大面。对于非线性函数,我们证明了该问题对于奇数$k \geq 7$和偶数$k \geq 10$是NP完全的。此外,我们还刻画了允许3-和4-一致嵌入的双连通平面多重图(在$k$ -一致嵌入中,所有的面都有大小$k$),并给出了一个有效的算法来检验6-一致嵌入的存在性。

英文摘要:

Motivated by finding planar embeddings that lead to drawings with favorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-graph such that the largest face is as small as possible and such that all faces have the same size, respectively. We prove a complexity dichotomy for MINMAXFACE and show that deciding whether the maximum is at most $k$ is polynomial-time solvable for $k \leq 4$ and NP-complete for $k \geq 5$. Further, we give a 6-approximation for minimizing the maximum face in a planar embedding. For UNIFORMFACES, we show that the problem is NP-complete for odd $k \geq 7$ and even $k \geq 10$. Moreover, we characterize the biconnected planar multi-graphs admitting 3- and 4-uniform embeddings (in a $k$-uniform embedding all faces have size $k$) and give an efficient algorithm for testing the existence of a 6-uniform embedding.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑