Uniform Planar Embedding Is Np - Complete
نویسنده
چکیده
منابع مشابه
Planar Embeddings with Small and Uniform Faces
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...
متن کاملFinding Bimodal and Acyclic Orientations of Mixed Planar Graphs is NP-Complete
We investigate the computational complexity of the following problem. Given a “mixed” planar graph, i.e., a planar graph where some edges are directed, orient the remaining edges in such a way that the whole graph is acyclic and admits a bimodal planar embedding, that is, a planar embedding where edges entering (exiting) each vertex appear consecutively in its circular adjacency list. We show t...
متن کاملComplexity of Planar Embeddability of Trees inside Simple Polygons
Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane bounded by a simple polygon and a free tree, we show that deciding whether there is a planar straight-line embedding of the tree on the point set inside the...
متن کاملOn the $\mathcal{NP}$-hardness of GRacSim Drawing and k-SEFE Problems
We study the complexity of two problems in simultaneous graph drawing. The first problem, GRACSIM DRAWING, asks for finding a simultaneous geometric embedding of two graphs such that only crossings at right angles are allowed. The second problem, K-SEFE, is a restricted version of the topological simultaneous embedding with fixed edges (SEFE) problem, for two planar graphs, in which every priva...
متن کاملUpward Point-Set Embeddability
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph D has an upward planar embedding into a point set S. We show that any switch tree admits an upward planar straight-line embedding into any convex point set. For the class of k-switch trees, that is a generalization of switch trees (according to this definition a switch t...
متن کامل