Abstract: Gielis transformations are a generalization of Lame curves. To combine domains, we can make use of the natural alliance between Lame's work and Rvachev's R-functions. A logical next step is the extension to n-valued logic dening dierent partitions.

Abstract: Generalized Möbius-Listing surfaces and bodies generalize Möbius bands, and this research was motivated originally by solutions of boundary value problems. Analogous to cutting of the original Möbius band, for this class of surfaces and bodies, results have been obtained when cutting such bodies or surfaces. The results can be applied in a wide range of fields in the natural science, and here we propose how they can serve as a model for the heart and the circulatory system.

Abstract: Gielis curves (GC) can represent a wide range of shapes and patterns ranging from star shapes to symmetric and asymmetric polygons, and even self intersecting curves. Such patterns appear in natural objects or phenomena, such as flowers, crystals, pollen structures, animals, or even wave propagation. Gielis curves and surfaces are an extension of Lamé curves and surfaces (superquadrics) which have benefited in the last two decades of extensive researches to retrieve their parameters from various data types, such as range images, 2D and 3D point clouds, etc. Unfortunately, the most efficient techniques for superquadrics recovery, based on deterministic methods, cannot directly be adapted to Gielis curves. Indeed, the different nature of their parameters forbids the use of a unified gradient descent approach, which requires initial pre-processings, such as the symmetry detection, and a reliable pose and scale estimation. Furthermore, even the most recent algorithms in the literature remain extremely sensitive to initialization and often fall into local minima in the presence of large missing data. We present a simple evolutionary algorithm which overcomes most of these issues and unifies all of the required operations into a single though efficient approach. The key ideas in this paper are the replacement of the potential fields used for the cost function (closed form) by the shortest Euclidean distance (SED, iterative approach), the construction of cost functions which minimize the shortest distance as well as the curve length using R-functions, and slight modifications of the evolutionary operators. We show that the proposed cost function based on SED and R-function offers the best compromise in terms of accuracy, robustness to noise, and missing data.

Abstract: In the present paper we consider the “bulky knots'' and ”bulky links'', which appear after cutting a Generalized Möbius Listing's GMLn3 body (whose radial cross section is a plane 3-symmetric figure with three vertices) along different Generalized Möbius Listing's surfaces GMLn2 situated in it. This article is aimed to investigate the number and geometric structure of the independent objects appearing after such a cutting process of GMLn3 bodies. In most cases we are able to count the indices of the resulting mathematical objects according to the known tabulation for Knots and Links of small complexity.

Abstract: In this paper, we consider the bulky knots and bulky links, which appear after cutting of a Generalized MöbiusListing GMLn2 body (with the radial cross section a convex plane 2-symmetric figure with two vertices) along a different Generalized MöbiusListing surfaces GMLn2 situated in it. The aim of this report is to investigate the number and geometric structure of the independent objects that appear after such a cutting process of GMLn2 bodies. In most cases we are able to count the indices of the resulting mathematical objects according to the known classification for the standard knots and links.