The paper discusses a methodology for applying local geometric operators in order to smooth polyhedral objects. The starting point of the method is very similar to the notion of discrete smooth interpolation introduced by Mallet. Unlike his approach, which is based on the smoothing operator being a linear operator, the method in this paper allows for a somewhat larger class of operators. An example is given of a nonlinear smoothing operator which is helpful in remedying some artifacts that may arise in the application of linear operators
AbstractBoolean sum smooth interpolation to boundary data on a triangle is described. Sufficient con...
The conventional constant strain smoothing technique yields less accurate solutions that other techn...
A smoother version of a polygon ½ is defined as a polygon which approximates ξ according to a given ...
The paper discusses a methodology for applying local geometric operators in order to smooth polyhedr...
Publie dans : Computer Aided Design, Vol. 24, No 4, 1992, p. 178-191Available at INIST (FR), Documen...
In this paper, it is shown how the Discrete Smooth Interpolation method (D.S.I.) may be used as a ne...
In the first part of this paper we apply a saddle point theorem from convex analysis to show that va...
summary:In the paper, we are concerned with some computational aspects of smooth approximation of da...
This monograph examines and develops the Global Smoothness Preservation Property (GSPP) and the Shap...
Abstract. We describe a simple geometric transformation of triangles which leads to an efficient and...
AbstractThe purpose of this paper is to describe new schemes of interpolation to the boundary values...
This paper presents a technique for smoothing polygonal surface meshes that avoids the well-known pr...
Works deals with generalized smoothing problem, which involves particular cases as an interpolating ...
Embark on an exploration of subdivision schemes and some heuristics for developing new schemes with ...
SUMMARY. Local polynomial smoothers recently received much attention in the lit-erature, owing to th...
AbstractBoolean sum smooth interpolation to boundary data on a triangle is described. Sufficient con...
The conventional constant strain smoothing technique yields less accurate solutions that other techn...
A smoother version of a polygon ½ is defined as a polygon which approximates ξ according to a given ...
The paper discusses a methodology for applying local geometric operators in order to smooth polyhedr...
Publie dans : Computer Aided Design, Vol. 24, No 4, 1992, p. 178-191Available at INIST (FR), Documen...
In this paper, it is shown how the Discrete Smooth Interpolation method (D.S.I.) may be used as a ne...
In the first part of this paper we apply a saddle point theorem from convex analysis to show that va...
summary:In the paper, we are concerned with some computational aspects of smooth approximation of da...
This monograph examines and develops the Global Smoothness Preservation Property (GSPP) and the Shap...
Abstract. We describe a simple geometric transformation of triangles which leads to an efficient and...
AbstractThe purpose of this paper is to describe new schemes of interpolation to the boundary values...
This paper presents a technique for smoothing polygonal surface meshes that avoids the well-known pr...
Works deals with generalized smoothing problem, which involves particular cases as an interpolating ...
Embark on an exploration of subdivision schemes and some heuristics for developing new schemes with ...
SUMMARY. Local polynomial smoothers recently received much attention in the lit-erature, owing to th...
AbstractBoolean sum smooth interpolation to boundary data on a triangle is described. Sufficient con...
The conventional constant strain smoothing technique yields less accurate solutions that other techn...
A smoother version of a polygon ½ is defined as a polygon which approximates ξ according to a given ...