Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Mathematics Of Computing (G) > Numerical Analysis (G.1) > Interpolation (G.1.1) > Smoothing (G.1.1...)  
 
Options:
 
  1-10 of 14 Reviews about "Smoothing (G.1.1...)": Date Reviewed
  A sharpness dependent filter for mesh smoothing
Chen C., Cheng K.  Computer Aided Geometric Design 22(5): 376-391, 2005. Type: Article

Mesh representation is commonly used to represent the surfaces of three-dimensional (3D) objects. When an object is represented as a computer readable file (for example, by laser scanning), the values captured may be subject to numerical noise...

Feb 15 2006
  Accurate optical flow computation under non-uniform brightness variations
Teng C., Lai S., Chen Y., Hsu W.  Computer Vision and Image Understanding 97(3): 315-346, 2005. Type: Article

In this paper, the authors revise a former approach from Horn and Schunck’s and Lai and Vemuri’s framework to compute optical flow. Horn and Schunck’s regularization gradient-based method’s drawbacks relate mainly to the...

Jun 10 2005
  Applications of smoothing methods in numerical analysis and optimization
Chen X.  In Focus on computational neurobiology. Commack, NY: Nova Science Publishers, Inc., 2004. Type: Book Chapter

This chapter presents an overview of the use of smoothing methods for addressing various approximation optimization problems for which the objective function F(x) is nonsmooth. In this context, “smooth” means...

Jan 27 2005
  Additive and multiplicative multi-grid--a comparison
Bastian P., Hackbusch W. (ed), Wittum G.  Computing 60(4): 345-364, 1998. Type: Article

Many variants of multigrid have been developed. In this paper, the authors present a comparative study of additive and multiplicative multigrid. They also investigate the behavior of multigrid variants with respect to smoothing, which plays an...

Mar 1 1999
  Constrained smoothing of histograms by quadratic splines
Schmidt J. (ed)  Computing 48(1): 97-107, 1992. Type: Article

The standard histospline problem for a histogram F = f 1 ,..., f n on a mesh &Dgr; = x 0 < x 1 < ... < x n involves...

Jul 1 1993
  Blending algebraic surfaces
Warren J.  ACM Transactions on Graphics 8(4): 263-278, 1989. Type: Article

If two surfaces are implicitly defined by the polynomials A and B, and two curves g and h on the surfaces are implicitly defined by the auxiliary polynomials G and H, then a surface implicitly defined by...

Jul 1 1991
  Automatic parameterization of rational curves and surfaces IV: algebraic space curves
Abhyankar S., Bajaj C.  ACM Transactions on Graphics 8(4): 325-334, 1989. Type: Article

In earlier papers, the authors described algorithms from algebraic geometry for determining the genus of a plane curve and for obtaining a rational parametrization of the curve when its genus is zero. These results are of great value in...

Jul 1 1991
  Conditions for tangent plane continuity over recursively generated B-spline surfaces
Ball A., Storry D.  ACM Transactions on Graphics 7(2): 83-102, 1988. Type: Article

The authors study some properties of surfaces which can be constructed by iteratively “knocking off” corners of an arbitrary polyhedron. Various versions of this recursive subdivision technique were proposed and evaluated by Catmull...

Feb 1 1990
  Smoothing surfaces using reflection lines for families of splines
Kaufmann E., Klass R.  Computer-Aided Design 20(6): 312-316, 1988. Type: Article

This paper describes a method for smoothing surfaces that has been used successfully to improve the quality of outer skin surfaces in automobile body design. The method involves smoothing reflection lines and then interpolating back to determine...

Aug 1 1989
  Discrete smooth interpolation
Mallet J.  ACM Transactions on Graphics 8(2): 121-144, 1989. Type: Article

This paper gives a method for constructing a grid of points from scattered data; in the examples, though, the author assumes that the data points are a subset of the grid points. The grid values minimize a certain discrete pseudonorm; this...

Aug 1 1989
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2013 ThinkLoud, Inc.
Terms of Use
| Privacy Policy