The work includes a comparative study of several contouring methods for univariate surfaces. It focusses specially on the comparison of the algorithms for the interpolation of irregular data sets (triangular Shepard, Powell & Sabin, Clough & Tocher). They are discussed in terms of smoothness and precission of the curves, amount of storage and computing time. Methods for the generation of the contours, clipping against the boundaries and writing legends are also discussed briefly
Most computer contour mapping of irregularly spaced data points is performed using an intermediate r...
This paper presents a new approach to the construction of a surface from a stack of contour slices. ...
: Five points in general position in IR 2 always lie on a unique conic, and three points plus two ...
Contour maps are frequently used to represent three-dimensional surfaces from geographical applicati...
Contour maps are frequently used to represent three-dimensional surfaces from geographical applicati...
Contour maps are frequently used to represent three-dimensional surfaces from geographical applicati...
La contrucción de una superficie que interpole un conjunto de puntos dados con unos ciertos requisit...
The production of drawings with surface contours starts from a set of given points defined by their ...
If we want to interpolate a set of data with a curve, we have several choices. We can use polynomial...
AbstractEfficient algorithms for shape preserving approximation to curves and surfaces are very impo...
In this paper we present an efficient method for interpolating a piecewise-linear surface between tw...
none4siParametric curved shape surface schemes interpolating vertices and normals of a given triangu...
AbstractIn this paper, a smooth interpolatory subdivision algorithm for the generation of interpolat...
Parametric representations of surfaces in Computer-Aided Geometric Design (CAGD) are often based on ...
Embark on an exploration of subdivision schemes and some heuristics for developing new schemes with ...
Most computer contour mapping of irregularly spaced data points is performed using an intermediate r...
This paper presents a new approach to the construction of a surface from a stack of contour slices. ...
: Five points in general position in IR 2 always lie on a unique conic, and three points plus two ...
Contour maps are frequently used to represent three-dimensional surfaces from geographical applicati...
Contour maps are frequently used to represent three-dimensional surfaces from geographical applicati...
Contour maps are frequently used to represent three-dimensional surfaces from geographical applicati...
La contrucción de una superficie que interpole un conjunto de puntos dados con unos ciertos requisit...
The production of drawings with surface contours starts from a set of given points defined by their ...
If we want to interpolate a set of data with a curve, we have several choices. We can use polynomial...
AbstractEfficient algorithms for shape preserving approximation to curves and surfaces are very impo...
In this paper we present an efficient method for interpolating a piecewise-linear surface between tw...
none4siParametric curved shape surface schemes interpolating vertices and normals of a given triangu...
AbstractIn this paper, a smooth interpolatory subdivision algorithm for the generation of interpolat...
Parametric representations of surfaces in Computer-Aided Geometric Design (CAGD) are often based on ...
Embark on an exploration of subdivision schemes and some heuristics for developing new schemes with ...
Most computer contour mapping of irregularly spaced data points is performed using an intermediate r...
This paper presents a new approach to the construction of a surface from a stack of contour slices. ...
: Five points in general position in IR 2 always lie on a unique conic, and three points plus two ...