Planarity Testing and Optimal Edge Insertion with Embedding Constraints
Many practical applications demand additional restrictions on an admissible planar embedding. In particular, constraints on the permitted (clockwise) order of the edges around a vertex, like so-called side constraints, abound. In this paper, we introduce a set of hierarchical embedding constraints that also comprises side constraints. We present linear time algorithms for testing if a graph is ec-planar, i.e., admits a planar embedding satisfying the given embedding constraints, as well as for computing such an embedding. Moreover, we characterize the set of all possible ec-planar embeddings and consider the problem of finding a planar combinatorial embedding of a planar graph such that an additional edge can be inserted with the minimum number of crossings; we show that this problem can still be solved in linear time under the additional restrictions of embedding constraints.
- 2.Böhringer, K.-F., Paulisch, F.N.: Using constraints to achieve stability in automatic graph layout algorithms. In: Proc. of CHI-90, pp. 43–51 (1990)Google Scholar
- 8.Dornheim, C.: Planar graphs with topological constraints. J. Graph Algorithms Appl. 6(1), 27–66 (2002), http://www.cs.brown.edu/publications/jgaa/accepted/2002/Dornheim2002.6.1.pdf MATHMathSciNetGoogle Scholar
- 10.Gutwenger, C., Klein, K., Mutzel, P.: Planarity testing and optimal edge insertion with embedding constraints. Technical Report TR06-1-005, Chair of Algorithm Engineering, University of Dortmund (2006)Google Scholar
- 12.Gutwenger, C., Mutzel, P.: An experimental study of crossing minimization heuristics. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 13–24. Springer, Heidelberg (2004)Google Scholar