Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
— This paper focuses on time-optimal path tracking, which involves planning of robot motions along prescribed geometric paths. Starting from a discretized convex reformulation of...
Diederik Verscheure, Moritz Diehl, Joris De Schutt...
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...