In this paper, a new method for coupling the finite element method (FEM) and the element-free Galerkin method (EFGM) is proposed for linear elastic and geometrically nonlinear problems using local maximum entropy shape functions in the EFG zone of the problem domain. These shape functions possess a weak Kronecker delta property at the boundaries which provides a natural way to couple the EFG an...

Figure 1: We present a view-based convolutional network that produces local, point-based shape descriptors. The network is trained such that geometrically and semantically similar points across different 3D shapes are embedded close to each other in descriptor space (left). Our produced descriptors are quite generic — they can be used in a variety of shape analysis applications, including dense...

It is shown that a collapsible, compact, connected, simplicial polyhedron admits a cubical subdivision and a median convexity, such that all cubes are convex subspaces with a convexity of subcubes. Conversely, a compact, connected, cubical polyhedron with a convexity as described admits a collapsible simplicial subdivision. Such a convexity, when it exists, is uniquely determined by the corresp...

Aggregates constitute major part of the pavement structure. The engineering properties of the aggregates, as well as its shape (i.e. form and angularity) and texture, substantially affect the overall performance of the pavement (Kuo and Freeman 1998, Maerz 2004). A number of researchers reported that form and surface texture of aggregates have significant effect on the mechanical property of th...

Surface registration is the process that brings scans into a common coordinate system by aligning their overlapping components, which can be achieved by finding a few pairs of matched points on each scan pair using shape descriptors and employing the matches to compute an alignment transformation. This paper proposes a local voxelizer descriptor, and the key idea is to define a unique local ref...

We define a variety of notions of cubical sets, based on sites organized using substructural algebraic theories presenting PRO(P)s or Lawvere theories. We prove that all our sites are test categories in the sense of Grothendieck, meaning that the corresponding presheaf categories of cubical sets model classical homotopy theory. We delineate exactly which ones are even strict test categories, me...

Preform design in multi-stage forging processes is critical to ensure the production of defect-free parts. Moreover, owing to the geometry and material-flow complexities in forging processes, finding the optimal preform shapes could be difficult and time consuming. This paper proposes an efficient preform design methodology based on geometrical resemblance, which requires several finite element...

Cubical sets and their homology have been used in dynamical systems as well as in digital imaging. We take a refreshing view on this topic, following Zariski ideas from algebraic geometry. The cubical topology is defined to be a topology in R in which a set is closed if and only if it is cubical. This concept is a convenient frame for describing a variety of important features of cubical sets. ...