Improved Bounds for Covering Paths and Trees in the Plane

by   Ahmad Biniaz, et al.

A covering path for a planar point set is a path drawn in the plane with straight-line edges such that every point lies at a vertex or on an edge of the path. A covering tree is defined analogously. Let π(n) be the minimum number such that every set of n points in the plane can be covered by a noncrossing path with at most π(n) edges. Let τ(n) be the analogous number for noncrossing covering trees. Dumitrescu, Gerbner, Keszegh, and Tóth (Discrete Computational Geometry, 2014) established the following inequalities: 5n/9 - O(1) < π(n) < (1-1/601080391)n, and 9n/17 - O(1) < τ(n)⩽⌊5n/6⌋. We report the following improved upper bounds: π(n)⩽(1-1/22)n, and τ(n)⩽⌈4n/5⌉. In the same context we study rainbow polygons. For a set of colored points in the plane, a perfect rainbow polygon is a simple polygon that contains exactly one point of each color in its interior or on its boundary. Let ρ(k) be the minimum number such that every k-colored point set in the plane admits a perfect rainbow polygon of size ρ(k). Flores-Peñaloza, Kano, Martínez-Sandoval, Orden, Tejel, Tóth, Urrutia, and Vogtenhuber (Discrete Mathematics, 2021) proved that 20k/19 - O(1) <ρ(k) < 10k/7 + O(1). We report the improved upper bound ρ(k)< 7k/5 + O(1). To obtain the improved bounds we present simple O(nlog n)-time algorithms that achieve paths, trees, and polygons with our desired number of edges.


page 5

page 6


Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges

Let T be an n-node tree of maximum degree 4, and let P be a set of n poi...

Improved Bounds for Guarding Plane Graphs with Edges

An "edge guard set" of a plane graph G is a subset Γ of edges of G such ...

Rainbow polygons for colored point sets in the plane

Given a colored point set in the plane, a perfect rainbow polygon is a s...

Flipping Plane Spanning Paths

Let S be a planar point set in general position, and let 𝒫(S) be the set...

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...

No Selection Lemma for Empty Triangles

Let S be a set of n points in general position in the plane. The Second ...

Continuous Toolpath Planning in Additive Manufacturing

We develop a framework that creates a new polygonal mesh representation ...

Please sign up or login with your details

Forgot password? Click here to reset