This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Introduction to Geometric Processing through Optimization
July-Aug. 2012 (vol. 32 no. 4)
pp. 88-94
Gabriel Taubin, Brown University
As an introduction to the field, this article shows how to formulate several geometry-processing operations to solve systems of equations in the“least-squares” sense. The equations are derived from local geometric relations using elementary concepts from analytic geometry, such as points, lines, planes, vectors, and polygons. Simple and useful tools for interactive polygon mesh editing result from the most basic descent strategies to solve these optimization problems. Throughout the article, the author develops the mathematical formulations incrementally, keeping in mind that the objective is to implement simple software for interactive editing applications that works well in practice. Readers can implement higher-performance versions of these algorithms by replacing the simple solvers proposed here with more advanced ones.
Index Terms:
Geometry,Mesh networks,Optimization,Smoothing methods,mesh,Geometry,Mesh networks,Optimization,Smoothing methods,smoothing,geometric optimization,polygon
Citation:
Gabriel Taubin, "Introduction to Geometric Processing through Optimization," IEEE Computer Graphics and Applications, vol. 32, no. 4, pp. 88-94, July-Aug. 2012, doi:10.1109/MCG.2012.80
Usage of this product signifies your acceptance of the Terms of Use.