We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky e...
Using the 3-dimensional structure tensor, dense displacement vector fields (DVF) can be computed with subpixel accuracy. The approach is based on the detection of linear symmetrie...
Critical points of a vector field are key to their characterization. Not only their positions but also their indexes are crucial for understanding vector fields. Considerable wo...
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...