69 research outputs found
Spectral-based mesh segmentation
In design and manufacturing, mesh segmentation is required for FACE construction in boundary representation (BRep), which in turn is central for featurebased design, machining, parametric CAD and reverse engineering, among others -- Although mesh segmentation is dictated by geometry and topology, this article focuses on the topological aspect (graph spectrum), as we consider that this tool has not been fully exploited -- We preprocess the mesh to obtain a edgelength homogeneous triangle set and its Graph Laplacian is calculated -- We then produce a monotonically increasing permutation of the Fiedler vector (2nd eigenvector of Graph Laplacian) for encoding the connectivity among part feature submeshes -- Within the mutated vector, discontinuities larger than a threshold (interactively set by a human) determine the partition of the original mesh -- We present tests of our method on large complex meshes, which show results which mostly adjust to BRep FACE partition -- The achieved segmentations properly locate most manufacturing features, although it requires human interaction to avoid over segmentation -- Future work includes an iterative application of this algorithm to progressively sever features of the mesh left from previous submesh removal
Transformation of the generalized chaotic system into canonical form
The paper deals with the developing of the numerical algorithms for transformation of generalized chaotic system into canonical form. Such transformation allows us to simplify control algorithm for chaotic system. These algorithms are defined by using Lie derivatives for output variable and solution of nonlinear equations. Usage of proposed algorithm is one of the ways for discovering of new chaotic attractors. These attractors can be obtained by transformation of known chaotic systems into various state spaces. Transformed attractors depend on both parameters of chaotic system and sample time of its discrete model
Solving eigenvalue problems on curved surfaces using the Closest Point Method
Eigenvalue problems are fundamental to mathematics and science. We present a
simple algorithm for determining eigenvalues and eigenfunctions of the
Laplace--Beltrami operator on rather general curved surfaces. Our algorithm,
which is based on the Closest Point Method, relies on an embedding of the
surface in a higher-dimensional space, where standard Cartesian finite
difference and interpolation schemes can be easily applied. We show that there
is a one-to-one correspondence between a problem defined in the embedding space
and the original surface problem. For open surfaces, we present a simple way to
impose Dirichlet and Neumann boundary conditions while maintaining second-order
accuracy. Convergence studies and a series of examples demonstrate the
effectiveness and generality of our approach
Anisotropic Laplace-Beltrami Operators for Shape Analysis
International audienceThis paper introduces an anisotropic Laplace-Beltrami operator for shape analysis. While keeping useful properties of the standard Laplace-Beltrami operator, it introduces variability in the directions of principal curvature, giving rise to a more intuitive and semantically meaningful diffusion process. Although the benefits of anisotropic diffusion have already been noted in the area of mesh processing (e.g. surface regularization), focusing on the Laplacian itself, rather than on the diffusion process it induces, opens the possibility to effectively replace the omnipresent Laplace-Beltrami operator in many shape analysis methods. After providing a mathematical formulation and analysis of this new operator, we derive a practical implementation on discrete meshes. Further, we demonstrate the effectiveness of our new operator when employed in conjunction with different methods for shape segmentation and matching
- …