Computer Aided Geometric Design最新文献

This paper presents a new method for the computation of the generalized Voronoi diagram of planar polygons. First, we show that the vertices of the cut locus can be computed efficiently. This is achieved by enumerating the tripoints of the polygon, a superset of the cut locus vertices. This is the set of all points that are of equal distance to three distinct topological entities. Then our algorithm identifies and connects the appropriate tripoints to form the cut locus vertex connectivity graph, where edges define linear or parabolic boundary segments between the Voronoi regions, resulting in the generalized Voronoi diagram. Our proposed method is validated on complex polygon soups. We apply the algorithm to represent the exact signed distance function of the polygon by augmenting the Voronoi regions with linear and radial functions, calculating the cut locus both inside and outside.

We introduce a non-commutative resultant, for slice regular polynomials in two quaternionic variables, defined in terms of a suitable Dieudonné determinant. We use this tool to investigate the existence of common zeros and common factors of slice regular polynomials and we give a kinematic interpretation of our results.

With the help of the Cox-de Boor recursion formula and the recurrence relation of the Bernstein polynomials, two categories of recursive algorithms for calculating the conversion matrix from an arbitrary non-uniform B-spline basis to a Bernstein polynomial basis of the same degree are presented. One is to calculate the elements of the matrix one by one, and the other is to calculate the elements of the matrix in two blocks. Interestingly, the weights in the two most basic recursion formulas are directly related to the weights in the recursion definition of the B-spline basis functions. The conversion matrix is exactly the Bézier extraction operator in isogeometric analysis, and we obtain the local extraction operator directly. With the aid of the conversion matrix, it is very convenient to determine the Bézier representation of NURBS curves and surfaces on any specified domain, that is, the isogeometric Bézier elements of these curves and surfaces.

In this paper, we present a novel face-based random walk method aimed at addressing the 3D semantic segmentation issue. Our method utilizes a one-dimensional convolutional neural network for detailed feature extraction from sequences of triangular faces and employs a stacked gated recurrent unit to gather information along the sequence during training. This approach allows us to effectively handle irregular meshes and utilize the inherent feature extraction potential present in mesh geometry. Our study's results show that the proposed method achieves competitive results compared to the state-of-the-art methods in mesh segmentation. Importantly, it requires fewer training iterations and demonstrates versatility by applying to a wide range of objects without the need for the mesh to adhere to manifold or watertight topology requirements.

With great enthusiasm and admiration we would like to pay tribute to Paul de Faget de Casteljau for his essential contribution to CAGD. Motivated by the development of automated human-computer collaboration for car industry, not only was he the very first pioneer in this field, but his initial geometric approach to creating shapes from poles was even undeniably the simplest and most remarkably effective. Two crucial points in this approach are to keep in mind: firstly, the idea of splitting one variable into several variables to facilitate the algorithmic construction of curves; secondly, the possibility of controlling shapes by means of osculating flats and corner-cutting algorithms. The present article is a partial survey on Chebyshevian blossoms intended to show that his ideas are still alive.