DeepAI
Log In Sign Up

Upward Point Set Embeddings of Paths and Trees

12/18/2020
by   Elena Arseneva, et al.
0

We study upward planar straight-line embeddings (UPSE) of directed trees on given point sets. The given point set S has size at least the number of vertices in the tree. For the special case where the tree is a path P we show that: (a) If S is one-sided convex, the number of UPSEs equals the number of maximal monotone paths in P. (b) If S is in general position and P is composed by three maximal monotone paths, where the middle path is longer than the other two, then it always admits an UPSE on S. We show that the decision problem of whether there exists an UPSE of a directed tree with n vertices on a fixed point set S of n points is NP-complete, by relaxing the requirements of the previously known result which relied on the presence of cycles in the graph, but instead fixing position of a single vertex. Finally, by allowing extra points, we guarantee that each directed caterpillar on n vertices and with k switches in its backbone admits an UPSE on every set of n 2^k-2 points.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/16/2020

Compatible Paths on Labelled Point Sets

Let P and Q be finite point sets of the same cardinality in ℝ^2, each la...
07/29/2018

On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples

An L-shaped embedding of a tree in a point set is a planar drawing of th...
09/30/2019

A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps

In the Directed Disjoint Paths problem, we are given a digraph D and a s...
07/01/2017

Angle-monotone Paths in Non-obtuse Triangulations

We reprove a result of Dehkordi, Frati, and Gudmundsson: every two verti...
03/12/2020

Duality pairs and homomorphisms to oriented and unoriented cycles

In the homomorphism order of digraphs, a duality pair is an ordered pair...
03/12/2020

Duality pairs and homomorphisms to oriented and un-oriented cycles

In the homomorphism order of digraphs, a duality pair is an ordered pair...
08/01/2018

Tverberg-Type Theorems with Trees and Cycles as (Nerve) Intersection Patterns

Tverberg's theorem says that a set with sufficiently many points in R^d ...