The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
Abstract-- We consider a variation of the classical MarkovDubins problem dealing with curvature-constrained, shortest paths in the plane with prescribed initial and terminal positi...
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...