Showing papers in "Computer Aided Geometric Design in 2018"

TL;DR: A 3D-CNN based gradient-weighted class activation mapping (3D-GradCAM) method that can provide visual explanations of the local geometric features of interest within an object is developed.

TL;DR: A general framework for coupling surfaces in space is presented as well as an approach to overcome C 1 -locking by local degree elevation along the patch interfaces, which allows the modeling of solutions to 4th order PDEs on complex geometric surfaces, provided that the given patches have G 1 continuity.

TL;DR: A sampling method that enables the reconstruction of a curve or surface that takes into account two factors: the regularity of the sampling and the complexity of the object.

TL;DR: An algorithm for computing injective IGA-suitable planar parameterizations with as uniform and orthogonal as possible iso-parametric structure and demonstrates the superiority of this method over various complex domains.

TL;DR: An algorithm is presented capable of generating folding-free mappings from a large number of geometry contours, including complicated geometries from industrial applications with extreme aspect ratios by combining EGG with automatized reparameterization techniques and a sophisticated numerical approach for solving resulting governing (nonlinear) equations.

TL;DR: The good performance of direct slicing of F- rep models supports the view that F-rep is more suitable than the traditional B-rep as a specified input geometry of 3D printing.

TL;DR: An efficient algorithm to compute the quasi-conformal map by solving two convex optimization problems alternatively is proposed and experimental results show that this approach outperforms previous approaches in producing bijective and low-rank parametric spline representations of planar domains.

TL;DR: Compared with other state-of-the-art denoising methods, this approach is more robust in removing small-scale geometric features while retaining large-scale structures and exhibits superiority in preventing large- scale sharp structures from severe distortion.

TL;DR: Knot vectors computed with this approach outperform state of the art methods and yield tighter approximations in B-spline curve approximation.

TL;DR: It is demonstrated that the twofold adaptive nature of the method, which takes into account both the shape and the distribution of the data, is crucial to define an effective fully automatic scheme with suitable local refinement capabilities.

TL;DR: Two generalisations of Gregory patches to faces of any valency are proposed by using generalised barycentric coordinates in combination with two kinds of multisided Bezier patches to allow for cross-boundary derivatives to be defined independently per side.

TL;DR: In this paper, a conformal mesh parameterization algorithm based on the Calabi energy and Calabi flow with solid theoretical and mathematical base is presented, and the performance of the algorithm is comparably the same with other methods.

TL;DR: An extremely versatile solution that can handle all the previously described issues in a user-friendly way and which is based on an original multi-front advancing triangulation technique guided by implicit surfaces and based on a prioritization mechanism that drastically reduces front interferences, concurrently producing high quality meshing is proposed.

TL;DR: A novel scheme of generating hybrid interior support structures for 3D printing that obtains higher strength-to-weight ratio than recent competing approaches that use single types of interior structures.

TL;DR: A linear combination of the constraint equations independent of the joint variables is compared with a general quadric in the 7-dimensional projective space P 7 to obtain some relations between the design parameters of 3-RPS manipulators with coplanar revolute joints, such that those manipulators have two operation modes.

TL;DR: A multi-scale mesh-free EMD algorithm for point clouds and their analysis and processing is developed, which does not explicitly resort to sharp feature detection and is more suitable for complex geometric models.

TL;DR: This method aims to optimize the mesh's adaptation to the shape for every pose expected during animation or deformation rather than for one specific reference state, in contrast to previous approaches which target static geometry.

TL;DR: This work developed and implemented one practical and convergent estimate of the Laplace–Beltrami operator for point clouds as well as a number of clustering techniques adapted to work directly on point clouds to produce geometric features of engineering interest.

TL;DR: The method for designing 3D origami has potential applications ranging from self-folding tessellations to deployable architectures, and analytically calculates the 3D Origami shape with an axisymmetric structure.

TL;DR: Three recipes for bivariate quasi-interpolation methods based on C 1 cubic Powell–Sabin B-spline representations are investigated, which can be implemented with any local cubic polynomial approximation scheme (or a mixture of them).

TL;DR: This work builds on previous work to derive a local, directed, and discrete measure for density that can be intrinsically computed within the point cloud, that is without further knowledge of the geometry despite the given point samples.

TL;DR: This work introduces a method for approximating non-smooth multivariate functions of the form g + r_+ and shows that the correction term is the solution to a Moving Least Squares (MLS) problem, and as such can both be easily computed and is smooth.

TL;DR: A simplex spline basis for a space of C1-cubics on the Clough-Tocher split on a triangle is proposed and two Marsden-like identities, three quasi-interpolants with optimal approximation order and L ∞ stability of the basis are derived.

TL;DR: A novel algorithm to decompose a 3D object into an atlas of disk-like charts with controlled shape and topology is proposed, which can be of two types: topological quads and topological octagons.

TL;DR: It is discovered that the conditions of Class A Bezier curves presented in Farin (2006) are incorrect and counter examples are presented, which have non-monotone curvature but satisfy Farin's conditions.

TL;DR: A new, simpler algorithmic approach is presented which is applicable to a natural family of three-dimensional periodic bar-and-joint frameworks with three degrees of freedom, which includes most zeolite structures, which are important for applications in computational materials science.

TL;DR: The proposed approach is variadic: it evaluates a Boolean expression regarding multi-input meshes as a whole rather than a tree of decomposed binary operations, which is robust for solid inputs and has advantages in performance compared to some previous non-robust methods.

TL;DR: A construction of parametric polynomial interpolants of a circular arc possessing maximal geometric smoothness is constructed via a complex factorization of the implicit unit circle equation.

TL;DR: The result suggests that the log-aesthetic curves and their generalization can be regarded as the similarity geometric analogue of Euler's elasticae.

TL;DR: Experimental results show that the proposed vessel cross-section based implicit vascular modeling technique can correctly represent the morphology and topology of vascular structures with high level of smoothness.