Computer Aided Geometric Design最新文献

Splines in the manifold setting have been defined as extensions from the standard Euclidean setting, but they are far more complicated. Alternative approaches, which are equivalent in the Euclidean case, lead to different results in the manifold case; the existence conditions are often quite restrictive; and the necessary computations are rather involved. All difficulties stem from the peculiar nature of the geodesic distance: in general, shortest geodesics may be not unique and the dependence on their endpoints may not be smooth; and distances cannot be computed in closed form. The former issue may impose strong limitations on the placement of control points. While the latter may greatly complicate the computations. Nevertheless, some recent results suggest that splines on surfaces may have practical impact on CAGD applications. We review the literature on this topic, accounting for both theoretical results and practical implementations.

Avoiding singularities is a crucial task in robotics and path planning. This paper proposes a novel algorithm for detecting the closest singularity to a given pose for nine interpretations of the 3-RPR manipulator. The algorithm utilizes intrinsic metrics based on the framework's total elastic strain energy density, employing the physical concept of Green-Lagrange strain. The constrained optimization problem for detecting the closest singular configuration with respect to these metrics is solved globally using tools from numerical algebraic geometry implemented in the software package Bertini. The effectiveness of the proposed algorithm is demonstrated on a 3-RPR manipulator executing a one-parametric motion. Additionally, the obtained intrinsic singularity distances are compared with extrinsic metrics. Finally, the paper illustrates the advantage of employing a well-defined metric for identifying the closest singularities in comparison with the existing methods in the literature, highlighting its application in design optimization.

Various interpolation and approximation methods arising in several practical applications in geometric modeling deal, at a particular step, with the problem of computing suitable rational patches (of low degree) on the unit sphere. Therefore, we are concerned with the construction of a system of spherical triangular patches with prescribed vertices that globally meet along common boundaries. In particular, we investigate various possibilities for tiling a given spherical triangular patch into quadratically parametrizable subpatches. We revisit the condition that the existence of a quadratic parameterization of a spherical triangle is equivalent to the sum of the interior angles of the triangle being π, and then circumvent this limitation by studying alternative scenarios and present constructions of spherical macro-elements of the lowest possible degree. Applications of our method include algorithms relying on the construction of (interpolation) surfaces from prescribed rational normal vector fields.

We investigate the construction of $C^2$ cubic spline quasi-interpolants on a given arbitrary triangulation $T$ to approximate a sufficiently smooth function f. The proposed quasi-interpolants are locally represented in terms of a simplex spline basis defined on the cubic Wang–Shi refinement of the triangulation. This basis behaves like a B-spline basis within each triangle of $T$ and like a Bernstein basis for imposing smoothness across the edges of $T$. Any element of the cubic Wang–Shi spline space can be uniquely identified by considering a local Hermite interpolation problem on every triangle of $T$. Different $C^2$ cubic spline quasi-interpolants are then obtained by feeding different sets of Hermite data to this Hermite interpolation problem, possibly reconstructed via local polynomial approximation. All the proposed quasi-interpolants reproduce cubic polynomials and their performance is illustrated with various numerical examples.

Reverse engineering Computer-Aided Design (CAD) models based on the original geometry is a valuable and challenging research problem that has numerous applications across various tasks. However, previous approaches have often relied on excessive manual interaction, leading to limitations in reconstruction speed. To mitigate this issue, in this study, we approach the reconstruction of a CAD model by sequentially constructing geometric primitives (such as vertices, edges, loops, and faces) and performing Boolean operations on the generated CAD modules. We address the complex reconstruction problem in four main steps. Firstly, we use a plane to cut the input mesh model and attain a loop cutting line, ensuring accurate normals. Secondly, the cutting line is automatically fitted to edges using primitive information and connected to form a primitive loop. This eliminates the need for time-consuming manual selection of each endpoint and significantly accelerates the reconstruction process. Subsequently, we construct the loop of primitives as a chunked CAD model through a series of CAD procedural operations, including extruding, lofting, revolving, and sweeping. Our approach incorporates an automatic height detection mechanism to minimize errors that may arise from manual designation of the extrusion height. Finally, by merging Boolean operations, these CAD models are assembled together to closely approximate the target geometry. We conduct a comprehensive evaluation of our algorithm using a diverse range of CAD models from both the Thingi10K dataset and real-world scans. The results validate that our method consistently delivers accurate, efficient, and robust reconstruction outcomes while minimizing the need for manual interactions. Furthermore, our approach demonstrates superior performance compared to competing methods, especially when applied to intricate geometries.

This paper describes an implementation and tests of a blending scheme for regularly sampled data interpolation, and in particular studies the order of approximation for the method. This particular implementation is a special case of an earlier scheme by Fang for fitting a parametric surface to interpolate the vertices of a closed polyhedron with n-sided faces, where a surface patch is constructed for each face of the polyhedron, and neighbouring faces can meet with a user specified order of continuity. The specialization described in this paper considers functions of the form $z=f(x,y)$ with the patches meeting with $C^2$ continuity. This restriction allows for investigation of order of approximation, and it is shown that the functional version of Fang's scheme has polynomial precision.

This paper introduces a family of subdivision schemes that generate curves over manifolds from manifold-Hermite data. This data consists of points and tangent directions sampled from a curve over a manifold. Using a manifold-Hermite average based on the De Casteljau algorithm as our main building block, we show how to adapt a geometric approach for curve approximation over manifold-Hermite data. The paper presents the various definitions and provides several analysis methods for characterizing properties of both the average and the resulting subdivision schemes based on it. Demonstrative figures accompany the paper's presentation and analysis.

This paper introduces a novel class of fair and interpolatory planar curves called pκ-curves. These curves are comprised of smoothly stitched Bézier curve segments, where the curvature distribution of each segment is made to closely resemble a parabola, resulting in an aesthetically pleasing shape. Moreover, each segment passes through an interpolated point at a parameter where the parabola has an extremum, encouraging the alignment of interpolated points with curvature extrema. To achieve these properties, we tailor an energy functional that guides the optimization process to obtain the desired curve characteristics. Additionally, we develop an efficient algorithm and an initialization method, enabling interactive modeling of the pκ-curves without the need for global optimization. We provide various examples and comparisons with existing state-of-the-art methods to demonstrate the curve modeling capabilities and visually pleasing appearance of pκ-curves.

Recent breakthroughs in neural radiance fields have significantly advanced the field of novel view synthesis and 3D reconstruction from multi-view images. However, the prevalent neural volume rendering techniques often suffer from long rendering time and require extensive network training. To address these limitations, recent initiatives have explored explicit voxel representations of scenes to expedite training. Yet, they often fall short in delivering accurate geometric reconstructions due to a lack of effective 3D representation. In this paper, we propose an octree-based approach for the reconstruction of implicit surfaces from multi-view images. Leveraging an explicit, network-free data structure, our method substantially increases rendering speed, achieving real-time performance. Moreover, our reconstruction technique yields surfaces with quality comparable to state-of-the-art network-based learning methods. The source code and data can be downloaded from https://github.com/LaoChui999/Octree-VolSDF.

We study planar quartic $G^2$ Hermite interpolation, that is, a quartic polynomial curve interpolating two planar data points along with the associated tangent directions and curvatures. When the two specified tangent directions are non-parallel, a quartic Bézier curve interpolating such $G^2$ data is constructed using two geometrically meaningful shape parameters which denote the magnitudes of end tangent vectors. We then determine the two parameters by minimizing a quadratic energy functional or curvature variation energy. When the two specified tangent directions are parallel, a quartic $G^2$ interpolating curve exists only when an additional condition on $G^2$ data is satisfied, and we propose a modified optimization approach. Finally, we demonstrate the achievable quality with a range of examples and the application to curve modeling, and it allows to locally create $G^2$ smooth complex shapes. Compared with the existing quartic interpolation scheme, our method can generate more satisfactory results in terms of approximation accuracy and curvature profiles.