Combinatorics of Beacon-based Routing in Three Dimensions

12/20/2017
by   Jonas Cleve, et al.
0

A beacon is a point-like object which can be enabled to exert a magnetic pull on other point-like objects in space. Those objects then move towards the beacon in a greedy fashion until they are either stuck at an obstacle or reach the beacon's location. Beacons placed inside polyhedra can be used to route point-like objects from one location to another. A second use case is to cover a polyhedron such that every point-like object at an arbitrary location in the polyhedron can reach at least one of the beacons once the latter is activated. The notion of beacon-based routing and guarding was introduced by Biro et al. [FWCG'11] in 2011 and covered in detail by Biro in his PhD thesis [SUNY-SB'13], which focuses on the two-dimensional case. We extend Biro's result to three dimensions by considering beacon routing in polyhedra. We show that m+1/3 beacons are always sufficient and sometimes necessary to route between any pair of points in a given polyhedron P, where m is the number of tetrahedra in a tetrahedral decomposition of P. This is one of the first results that show that beacon routing is also possible in three dimensions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2019

Expected Complexity of Routing in Θ 6 and Half-Θ 6 Graphs

We study online routing algorithms on the Θ6-graph and the half-Θ6-graph...
research
02/22/2018

Learning to Route with Sparse Trajectory Sets---Extended Version

Motivated by the increasing availability of vehicle trajectory data, we ...
research
10/04/2021

Virtual Private Mobile Network with Multiple Gateways for B5G Location Privacy

In a beyond-5G (B5G) scenario, we consider a virtual private mobile netw...
research
10/23/2017

Constrained Routing Between Non-Visible Vertices

In this paper we study local routing strategies on geometric graphs. Suc...
research
09/13/2019

Location Order Recovery in Trails with Low Temporal Resolution

Researchers who study object movement problems related to topics like tr...
research
09/17/2019

Vehicle routing by learning from historical solutions

The goal of this paper is to investigate a decision support system for v...
research
11/16/2011

Good Pairs of Adjacency Relations in Arbitrary Dimensions

In this text we show, that the notion of a "good pair" that was introduc...

Please sign up or login with your details

Forgot password? Click here to reset