3 years ago

Minimizing the Continuous Diameter when Augmenting a Geometric Tree with a Shortcut.

Jean-Lou De Carufel, Stefan Schirra, Carsten Grimm, Anil Maheshwari, Michiel Smid

We augment a tree \$T\$ with a shortcut \$pq\$ to minimize the largest distance between any two points along the resulting augmented tree \$T+pq\$. We study this problem in a continuous and geometric setting where \$T\$ is a geometric tree in the Euclidean plane, where a shortcut is a line segment connecting any two points along the edges of \$T\$, and we consider all points on \$T+pq\$ (i.e., vertices and points along edges) when determining the largest distance along \$T+pq\$. We refer to the largest distance between any two points along edges as the continuous diameter to distinguish it from the discrete diameter, i.e., the largest distance between any two vertices.

We establish that a single shortcut is sufficient to reduce the continuous diameter of a geometric tree \$T\$ if and only if the intersection of all diametral paths of \$T\$ is neither a line segment nor a single point. We determine an optimal shortcut for a geometric tree with \$n\$ straight-line edges in \$O(n \log n)\$ time. Apart from the running time, our results extend to geometric trees whose edges are rectifiable curves. The algorithm for trees generalizes our algorithm for paths.

Publisher URL: http://arxiv.org/abs/1612.01370

DOI: arXiv:1612.01370v4

You might also like
Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.