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...

We present a volumetric method that can e ciently create triangular meshes from D geometric data This data can be presented in the form of im ages pro les or unordered points The mesh model can be created at di erent resolutions and can also be closed to make a true volumetric model

This paper describes the use of a previously developed surface model for representing 3D geometric information that is subject to uncertainty. The proposed model is based on a geometric data fusion technique that allows the efficient approximation of arbitrary triangular meshes in space with smooth surfaces. This paper shows how the shape modifiers defined in that model can be used to represent...

330 Abstract-This paper reviews the previously available methods to estimate the curvatures, both discrete and continuous for triangulated surface. Many applications such as surface segmentation, surface smoothing, surface reconstruction, and registration require the accurate estimation of curvature at the vertices of the triangulated surface. For the estimation of the curvature, several differ...

This paper presents a novel approach for detecting ridge-ravine lines on dense triangular meshes. We first retile the original mesh into to a simplified domain mesh. An arbitrary smooth parametric surface is constructed defined on the domain mesh. Ridges and ravines are then accurately and efficiently computed and detected using the smooth parameteric function. Our approach treats shape noise b...

We introduce a decentralized replication strategy for peerto-peer file exchange based on exhaustive exploration of the neighborhood of any node in the network. The replication scheme lets the replicas evenly populate the network mesh, while regulating the total number of replicas at the same time. This is achieved by self adaptation to entering or leaving of nodes. Exhaustive exploration is ach...

In this note, by using complex variable functions, we present a new simpler proof of the degeneracy property of the longest-edge n-section of triangles for n P 4. This means that the longest-edge n-section of triangles for n P 4 produces a sequence of triangles with minimum interior angle converging to zero. 2012 Elsevier Inc. All rights reserved.

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...