Finding a match between partially available deformable shapes is a challenging problem with numerous applications. The problem is usually approached by computing local descriptors on a pair of shapes and then establishing a point-wise correspondence between the two. In this paper, we introduce an alternative correspondence-less approach to matching fragments to an entire shape undergoing a non-...

A standard way of dealing with matrix polynomial eigenvalue problems is to use linearizations. Byers, Mehrmann and Xu have recently defined and studied linearizations of dimensions smaller than the classical ones. In this paper, lower bounds are provided for the dimensions of linearizations and strong linearizations of a given m×n matrix polynomial, and particular linearizations are constructed...

The nite-element, semi-implicit, and semi-Lagrangian methods are combined together to solve the shallow-water equations using unstructured triangular meshes. Triangular nite elements are attractive for ocean modeling because of their exibility for representing irregular boundaries and for local mesh re nement. A \kriging" interpolator is used for the semi-Lagrangian advection, leading to an acc...

While many parallel applications exhibit good spatial locality , other important codes in areas like graph problem-solving or CAD do not. Often, these irregular codes contain small records accessed via pointers. Consequently, while the former applications beneet from long cache lines, the latter prefer short lines. One good solution is to combine short lines with prefetching. In this way, each ...

Standard spatial convolutions assume input data with a regular neighborhood structure. Existing methods typically generalize convolution to the irregular point cloud domain by fixing “view” through e.g. fixed size, where kernel size remains same for each point. However, since clouds are not as structured images, neighbor number gives an unfortunate inductive bias. We present novel graph named D...

The English past tense system has recently been used to argue that formal grammatical categories (such as root. rule, and lexical item) may not be necessary to explain the acquisition and knowledge of language. Rumelhart and McClelland (1986) devised a connectionist model relying solely on phonological information; it is often suggested that any deficiencies of such a model can be remedied by s...

We consider the problem of extracting morphology of a terrain represented as a Triangulated Irregular Network (TIN). We propose a new algorithm and compare it with representative algorithms of the main approaches existing in the literature to this problem.

In this paper, we propose a nonlinear PDE model for reconstructing a regular surface from sampled data. At first, we show the existence and the uniqueness of a viscosity solution to this problem. Then we propose a numerical scheme for solving the nonlinear level set equation on unstructured triangulations adapted to the data sample. We show the consistency of this scheme. In addition, we show h...