This study explores an approach for analysing the mirror (reflective) symmetry of 3D shapes with tensor based sparse decomposition. The approach combines non-negative tensor decomposition and directional texture synthesis, with symmetry information about 3D shapes that is represented by 2D textures synthesised from sparse, decomposed images. This technique requires the center of mass of 3D obje...

In this work we consider the Method of Fundamental Solutions (MFS) applied to the calculation of eigenfrequencies and eigenmodes of 3D shapes. This meshless method was considered for 2D shapes (e.g. [1], [8]) and the application to 3D simply connected domains is analysed. We propose a choice of collocation and source points in 3D adapted from the algorithm presented in [1]. An example with Diri...

We present a bio-inspired calculus for describing 3D shapes moving in a space. A shapeforms a 3D process when combined with a behaviour. Behaviours are specified with a timedCCS-like process algebra using a notion of channel that models naturally binding sites on thesurface of shapes. Processes can represent molecules or other mobile objects. The calculusembeds collision det...

Abstract. We propose a new method to recognize 3D objects using segmentbased stereo vision. Predefined object models are compared with 3D boundaries which are extracted by the stereo vision. Boundaries may be straight lines, circular arcs and free-form curves. The models consist of the local shapes and the whole shapes of the boundaries. The models are constructed from samples of real objects o...

While the problem of image aesthetics has been well explored, the study of 3D shape aesthetics has focused on specific manually defined features. In this paper, we learn an aesthetics measure for 3D shapes autonomously from raw voxel data and without manually-crafted features by leveraging the strength of deep learning. We collect data from humans on their aesthetics preferences for various 3D ...

We present a new algorithm for reconstructing 3D shapes. The algorithm takes one 2D image of a 3D shape and reconstructs the 3D shape by applying a priori constraints: symmetry, planarity and compactness. The shape is reconstructed without using information about the surfaces, such as shading, texture, binocular disparity or motion. Performance of the algorithm is illustrated on symmetric polyh...

Yong Khoo, Sang Chung This paper presents an automated method for 3D character skeleton extraction that can be applied for generic 3D shapes. Our work is motivated by the skeleton-based prior work on automatic rigging focused on skeleton extraction and can automatically aligns the extracted structure to fit the 3D shape of the given 3D mesh. The body mesh can be subsequently skinned based on th...

In general, we shall start with one 1 in the first row and three l's in the second row. The recurrence then determines the subsequent rows. The first few rows of the rhombus are given in Figure 2. We assume all blank positions are zero. So, for example, when calculating the second entry in the third row the two zeros are assumed to be up two places and up one and to the left. We call this array...

A cluster for the octagonal square-rhombus tiling is presented, which has the property that among all tilings completely covered by the cluster the perfectly quasiperiodic and eightfold symmetric ones have the highest cluster density. Since on these eightfold symmetric tilings there is considerable overlap of clusters, it seems likely that these tiling have the highest cluster density even amon...