Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Local energy-optimizing subdivision algorithms
Ginkel I., Umlauf G. Computer Aided Geometric Design25 (3):137-147,2008.Type:Article
Date Reviewed: Jun 26 2008

The representation of a fitting surface is fundamental to a wide variety of applications, and it is central to computer-aided design (CAD). This paper focuses on one aspect of generating surfaces: the use of local methods to develop energy-optimizing techniques using iterative subdivision algorithms. These algorithms involve iterative techniques, and generate a sequence of finer control nets that converge to a subdivision surface. Such surfaces can exhibit artifacts, and the surface generated may be unacceptable; for example, one algorithm of Catmull-Clark discussed in the paper cannot generate surfaces with convex extraordinary points in some cases. Hybrid surfaces can also be generated with both positive and negative Gauss curvatures. The control of the surface can be expressed in terms of the eigenvalues and eigenvectors near the extraordinary point. The paper focuses on the eigenanalysis and the optimization of free parameters to control the surface.

The paper begins with a thorough treatment of related methods based on this approach, and the role of local and global optimization. Subdivision methods are then presented, followed by the tuning method and the use of Fourier analysis. Energy minimization is then introduced, locality is proven, and the results are presented.

This is a highly interesting and well-done paper. It presents the context of the subdivision algorithm, and goes on to improvements in the method that address the deficiencies of prior methods, thus improving upon those results.

Reviewer:  Mike Minkoff Review #: CR135764 (0905-0476)
Bookmark and Share
  Reviewer Selected
 
 
Eigenvalues And Eigenvectors (Direct And Iterative Methods) (G.1.3 ... )
 
 
Computations On Matrices (F.2.1 ... )
 
 
Interval Arithmetic (G.1.0 ... )
 
 
General (G.1.0 )
 
 
Numerical Algorithms And Problems (F.2.1 )
 
 
Optimization (G.1.6 )
 
Would you recommend this review?
yes
no
Other reviews under "Eigenvalues And Eigenvectors (Direct And Iterative Methods)": Date
On two more Eigenvalue methods for an alternating sequential parallel system
Wallach Y. Computing 32(1): 33-41, 1984. Type: Article
Feb 1 1985
Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
Courtois P., Semal P. Journal of the ACM 31(4): 804-825, 1984. Type: Article
Jun 1 1985
Solution of large, dense symmetric generalized eigenvalue problems using secondary storage
Grimes R., Simon H. (ed) ACM Transactions on Mathematical Software 14(3): 241-256, 1988. Type: Article
Mar 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy