On L-shaped point set embeddings of trees: first non-embeddable examples

Torsten Mütze; Manfred Scheucher

Home/Archive/arXiv

arXiv · 1807.11043

On L-shaped point set embeddings of trees: first non-embeddable examples

Torsten Mütze·Manfred Scheucher

View original source ↗Read source document ↗Export metadata ↓

Abstract

An L-shaped embedding of a tree in a point set is a planar drawing of the tree where the vertices are mapped to distinct points and every edge is drawn as a sequence of two axis-aligned line segments. There has been considerable work on establishing upper bounds on the minimum cardinality of a point set to guarantee that any tree of the same size with maximum degree 4 admits an L-shaped embedding on the point set. However, no non-trivial lower bound is known to this date, i.e., no known $n$-vertex tree requires more than $n$ points to be embedded. In this paper, we present the first examples of $n$-vertex trees for $n\in\{13,14,16,17,18,19,20\}$ that require strictly more points than vertices to admit an L-shaped embedding. Moreover, using computer help, we show that every tree on $n\leq 12$ vertices admits an L-shaped embedding in every set of $n$ points. We also consider embedding ordered trees, where the cyclic order of the neighbors of each vertex in the embedding is prescribed. For this setting, we determine the smallest non-embeddable ordered tree on $n=10$ vertices, and we show that every ordered tree on $n\leq 9$ or $n=11$ vertices admits an L-shaped embedding in every set of $n$ points. We also construct an infinite family of ordered trees which do not always admit an L-shaped embedding, answering a question raised by Biedl, Chan, Derka, Jain, and Lubiw.

Explore related subjects

cs.CG math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Torsten Mütze, Manfred Scheucher. 2020-04-29. On L-shaped point set embeddings of trees: first non-embeddable examples. https://arxiv.org/abs/1807.11043

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Stretch Factor of Planar Delaunay Triangulations Is Less Than 1.65

Delaunay triangulations are a fundamental class of plane spanners, and determining their worst-case stretch factor has been a longstanding problem in computational geometry. We prove an upper bound of $1.65$, improving the bound of $1.998$ due to Xia (2011) and reducing the gap to the known lower bound of $1.5932$ by a factor of more than seven. Our proof works with the chains of circumdisks introduced by Xia, along which a path between two sites is assembled disk by disk. Xia measures such a path against a quantity attached to the whole chain, and because that quantity is not additive, his induction has to be carried alongside a separate global estimate. Our main idea is to measure the path against the progress it makes along the segment joining the two sites. This quantity is additive, so the bound becomes a Bellman recursion that forgets all but one number about the disks already passed, and we show that the bound holds if and only if a potential on the current state satisfies three local inequalities. The smallest feasible potential is the value function of that recursion, so searching for a potential becomes the problem of fitting this value function from above. The geometry of the disks reduces the fit to a linear program over functions of one variable, in which a GPT-based multi-agent system that we developed found a feasible point, certified in exact arithmetic.

cs.CG↗

arXiv2026

Fast Persistent Homology Computation for Functions on $\mathbb{R}$

0-dimensional persistent homology is known, from a computational point of view, as the easy case. Indeed, given a list of $n$ edges in non-decreasing order of filtration value, one only needs a union-find data structure to keep track of the connected components and we get the persistence diagram in time $O(nα(n))$. The running time is thus usually dominated by sorting the edges in $Θ(n\log(n))$. A little-known fact is that, in the particularly simple case of studying the sublevel sets of a piecewise-linear function on $\mathbb{R}$ or $\mathbb{S}^1$, persistence can actually be computed in linear time. This note presents a simple algorithm that achieves this complexity and an extension to image persistence. An implementation is available in Gudhi.

cs.CG↗

arXiv2026

Numerical Simulation of Transdermal Insulin Delivery Using a Coated Microneedle in a 2D Skin Model

In this work, we present a computational model to investigate transdermal insulin delivery using coated microneedles. A detailed skin geometry incorporating a coated microneedles was developed to analyze insulin release through the different skin layers and to evaluate the influence of key transport parameters. The model represents the major skin layers: the stratum corneum, viable epidermis, and dermis. Unstructured grids were used to achieve a reliable resolution of the model. The simulations provide insights into the permeation of insulin from the coated microneedles and the transport and distribution across the different skin layers. Finally, the simulation results were compared with experimental data to evaluate the predictive capability of the model.

cs.CG↗