The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
The responsiveness of networked applications is limited by communications delays, making network distance an important parameter in optimizing the choice of communications peers. S...
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, D...
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...