作者: 軍火 時間: 2025-3-21 22:01 作者: 緯線 時間: 2025-3-22 03:51 作者: Exhilarate 時間: 2025-3-22 06:56
Computing Volume Properties Using Low-Discrepancy Sequences,sequences is presented which explains how they can be used to replace random points in Monte Carlo methods. The relative advantages of using low-discrepancy methods compared to random point sequences are discussed theoretically, and then practical results are given for a series of test objects which作者: employor 時間: 2025-3-22 11:50
,Bisectors and α-Sectors of Rational Varieties,ew some of them, mostly in ?. and ?.. We also describe the a-sector, a generalization of the bisector, and consider a few interesting cases where α-sectors become quadratic curves or surfaces. Exact α-sectors are non-rational even in special cases and in configurations where the bisectors are ration作者: OVER 時間: 2025-3-22 13:00 作者: OVER 時間: 2025-3-22 20:14 作者: FLAGR 時間: 2025-3-22 22:06
C4 Interpolatory Shape-Preserving Polynomial Splines of Variable Degree,ic properties as the segment degrees increase. The basic outcome of this investigation is an iterative algorithm for constructing C4 interpolants, which conform with the discrete convexity and torsion information contained in the associated polygonal interpolant. The performance of the algorithm, in作者: 占卜者 時間: 2025-3-23 02:06
Blossoming and Divided Difference,which is not included in the standard blossoming axioms. Here the blossom is extended to incorporate a new set of parameters along with a cancellation axiom. Both the standard blossom and the divided difference operator are special cases of this new extended blossom. It follows that these dual funct作者: 蟄伏 時間: 2025-3-23 05:35
Localizing the 4-Split Method for G1 Free-Form Surface Fitting,egular mesh. This surface mesh serves as a control mesh which is either interpolated or approximated. A new method for smooth triangular mesh interpolation has been developed. It is based on a regular 4-split of the domain triangles in order to solve the vertex consistency problem. In this paper a g作者: 無脊椎 時間: 2025-3-23 12:26
Surface Reconstruction Using Adaptive Clustering Methods,mensional space, without connectivity information, our method reconstructs a triangulated surface model in a two-step procedure. First, we apply an adaptive clustering technique to the given set of points, identifying point subsets in regions that are nearly planar. The output of this clustering ste作者: Tractable 時間: 2025-3-23 14:32
An Algorithm to Triangulate Surfaces in 3D Using Unorganised Point Clouds,rst build a triangular mesh to obtain an approximate surface representation. In this paper we describe an algorithm which works by creating and merging local triangular complexes to obtain an unambiguous 2D-manifold triangulation. We use all the given sample points as vertices, which is a natural re作者: Brain-Imaging 時間: 2025-3-23 18:53 作者: Hypopnea 時間: 2025-3-23 23:12
A Constraint-Based Method for Sculpting Free-Form Surfaces, automatically follows changes of the curve keeping a predefined set of constraints satisfied, specifically the incidence and tangency along one or several surface-curves. We review and update our approach presented earlier [18] and show how the curve-surface composition can be expressed as a linear作者: Fibrillation 時間: 2025-3-24 04:35
Exploiting Wavelet Coefficients for Modifying Functions,ets. This enables us to separate several aspects of a function and modify one selected exclusively. The quality of this approach is dependent on the choice of the wavelet decomposition. We demonstrate for Haar-wavelets how to estimate changes a priori and how to avoid modifications locally. A more g作者: 水土 時間: 2025-3-24 06:30 作者: Capture 時間: 2025-3-24 12:10
Data-Dependent Triangulation in the Plane with Adaptive Knot Placement,e describe a scheme for constructing a hierarchy of triangulations that approximates a given data set at varying levels of resolution. Intermediate triangulations can be associated with a particular level of a hierarchy by considering their approximation errors. We present a data-dependent triangula作者: 平常 時間: 2025-3-24 16:20
,Implicit Surfaces Revisited — ,-Patches,due to the lack of proper control for the interior of complex shapes and control of separate branches. The main attraction of implicit formulations is, however, that they represent a . based on distance functions. This property motivates our scheme, wherein classical implicit techniques are mixed wi作者: 館長 時間: 2025-3-24 19:55
Mapping Design Computing Researchthm for efficient tracking of the geodesics on these surfaces is presented. Existing methods for plane offset curves are adapted to generate .-spline approximations of parallel curves on arbitrary surfaces. An algorithm to determine singularities and cusps in the parallel curve is established.作者: 600 時間: 2025-3-25 01:13 作者: Panther 時間: 2025-3-25 05:33
Das Zeitalter der Staufer 1125–1257rfaces. The major issues discussed here are the domain mappings and the mapping of the feature control points. There are two types of domain mappings, depending on whether we paste as cylinder on a NUBS sheet or another NUBS cylinder. The mapping of the feature control points has to address both continuity and shape issues.作者: 種植,培養(yǎng) 時間: 2025-3-25 09:46 作者: lavish 時間: 2025-3-25 11:57
Piecewise Linear Wavelets over Type-2 Triangulations,angulations. In this paper we demonstrate the versatility of the semi-wavelet approach by using it to construct bases for the piecewise linear wavelet spaces induced by uniform refinements of four-directional box-spline grids.作者: Genome 時間: 2025-3-25 16:52 作者: ARENA 時間: 2025-3-25 21:44 作者: BARK 時間: 2025-3-26 02:16
Heidelberger Akademie der WissenschaftenBased upon the Loewner ellipsoid an affine invariant norm will be presented. This norm will be compared with the norm established by Nielson [10] using results of scattered data interpolation.作者: groggy 時間: 2025-3-26 07:27 作者: 尖牙 時間: 2025-3-26 09:45 作者: 耕種 時間: 2025-3-26 12:45
Geometric Modelling978-3-7091-6270-5Series ISSN 0344-8029 作者: rheumatism 時間: 2025-3-26 19:01 作者: 粘連 時間: 2025-3-27 00:59 作者: Medicaid 時間: 2025-3-27 04:45 作者: JOT 時間: 2025-3-27 06:11 作者: 臨時抱佛腳 時間: 2025-3-27 12:14 作者: POWER 時間: 2025-3-27 15:15 作者: 顛簸下上 時間: 2025-3-27 20:47 作者: invulnerable 時間: 2025-3-28 00:08
https://doi.org/10.1007/978-981-99-8394-0imizes the error criterion. We present a solution to this problem for the case that the surface represented by M is known to be part of the surface represented by N. The solution consists of two steps: coarse matching and refined matching. Coarse matching is performed by first selecting a limited nu作者: 螢火蟲 時間: 2025-3-28 03:42 作者: 對待 時間: 2025-3-28 08:45
The Nature and Nurture of Design Ability,which is not included in the standard blossoming axioms. Here the blossom is extended to incorporate a new set of parameters along with a cancellation axiom. Both the standard blossom and the divided difference operator are special cases of this new extended blossom. It follows that these dual funct作者: 抓住他投降 時間: 2025-3-28 11:08 作者: Oversee 時間: 2025-3-28 18:03 作者: 分期付款 時間: 2025-3-28 19:29 作者: 反饋 時間: 2025-3-29 01:14
Das Zeitalter der Staufer 1125–1257rfaces. The major issues discussed here are the domain mappings and the mapping of the feature control points. There are two types of domain mappings, depending on whether we paste as cylinder on a NUBS sheet or another NUBS cylinder. The mapping of the feature control points has to address both con作者: 規(guī)范就好 時間: 2025-3-29 06:49 作者: 去掉 時間: 2025-3-29 09:08
https://doi.org/10.1007/978-3-658-45008-3ets. This enables us to separate several aspects of a function and modify one selected exclusively. The quality of this approach is dependent on the choice of the wavelet decomposition. We demonstrate for Haar-wavelets how to estimate changes a priori and how to avoid modifications locally. A more g作者: Permanent 時間: 2025-3-29 12:13 作者: white-matter 時間: 2025-3-29 16:22
What You Will Teach with , Simulation,e describe a scheme for constructing a hierarchy of triangulations that approximates a given data set at varying levels of resolution. Intermediate triangulations can be associated with a particular level of a hierarchy by considering their approximation errors. We present a data-dependent triangula作者: 大包裹 時間: 2025-3-29 20:04 作者: 舉止粗野的人 時間: 2025-3-30 03:13
https://doi.org/10.1007/978-3-476-99587-2-Rep model. We also develop the application of the Alternating Sum of Volumes decomposition to this particular type of polyhedra by taking advantage of the simplicity of the EVM. Finally we outline our future work, which deals with the suitability of the EVM in the field of digital images processing.作者: dialect 時間: 2025-3-30 06:01 作者: Texture 時間: 2025-3-30 10:49 作者: Arb853 時間: 2025-3-30 13:59 作者: Expertise 時間: 2025-3-30 17:43 作者: inquisitive 時間: 2025-3-31 00:18
Feature-Based Matching of Triangular Meshes,eptable matching of the given meshes. For refined matching the iterated closest point approach is used which is speeded up by using an “nearest-neighbor-octree” for search space reduction. The solution aims at meshes with a high number of vertices.作者: TSH582 時間: 2025-3-31 04:23
Blossoming and Divided Difference,re presented that express the divided differences of polynomials in terms of the blossom. Canonical examples are provided for the blossom, the divided difference, and the extended blossom, and general proof procedures are developed based on these characteristic functions.作者: 偽書 時間: 2025-3-31 07:18 作者: 包裹 時間: 2025-3-31 10:57 作者: 感激小女 時間: 2025-3-31 15:14
C4 Interpolatory Shape-Preserving Polynomial Splines of Variable Degree,ch conform with the discrete convexity and torsion information contained in the associated polygonal interpolant. The performance of the algorithm, in particular the . effect of the achieved high parametric continuity, is tested and discussed for a planar and a spatial data set.作者: 補助 時間: 2025-3-31 19:15
An Algorithm to Triangulate Surfaces in 3D Using Unorganised Point Clouds,g local triangular complexes to obtain an unambiguous 2D-manifold triangulation. We use all the given sample points as vertices, which is a natural requirement. Our method is able to handle open boundaries and holes, different geni (for example tori) and unoriented surfaces in a computationally efficient way.作者: cataract 時間: 2025-4-1 00:15
,Implicit Surfaces Revisited — ,-Patches,, however, that they represent a . based on distance functions. This property motivates our scheme, wherein classical implicit techniques are mixed with new features. Several examples are given to prove the feasibility of .-patches for shape design.作者: 冒號 時間: 2025-4-1 02:47 作者: GIBE 時間: 2025-4-1 08:02 作者: ANNUL 時間: 2025-4-1 10:27
Newton D’souza,Mohammad R. Dastmalchi clearly demonstrate the superiority of the low-discrepancy method when used in a simple approach. Finally, the performance of such methods is assessed when used in conjunction with spatial subdivision in the svLis geometric modeller.作者: 緯度 時間: 2025-4-1 17:53
Foundations of Holistic Organization Designeneralization of the 4-split domain method is presented in that the method becomes completely local. It will further be shown how normal directions, i.e. tangent planes, can be prescribed at the patch vertices.
