ACM Home Page
Please provide us with feedback. Feedback
ABF++: fast and robust angle based flattening
Full text PdfPdf (8.04 MB)
Source ACM Transactions on Graphics (TOG) archive
Volume 24 ,  Issue 2  (April 2005) table of contents
Pages: 311 - 330  
Year of Publication: 2005
ISSN:0730-0301
Authors
Alla Sheffer  University of British Columbia, Vancouver, BC
Bruno Lévy  INRIA Lorraine, Vandoeuvre, France
Maxim Mogilnitsky  Technion, Haifa, Israel
Alexander Bogomyakov  Technion, Haifa, Israel
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 120,   Citation Count: 30
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1061347.1061354
What is a DOI?

ABSTRACT

Conformal parameterization of mesh models has numerous applications in geometry processing. Conformality is desirable for remeshing, surface reconstruction, and many other mesh processing applications. Subject to the conformality requirement, these applications typically benefit from parameterizations with smaller stretch. The Angle Based Flattening (ABF) method, presented a few years ago, generates provably valid conformal parameterizations with low stretch. However, it is quite time-consuming and becomes error prone for large meshes due to numerical error accumulation. This work presents ABF++, a highly efficient extension of the ABF method, that overcomes these drawbacks while maintaining all the advantages of ABF. ABF++ robustly parameterizes meshes of hundreds of thousands and millions of triangles within minutes. It is based on three main components: (1) a new numerical solution technique that dramatically reduces the dimension of the linear systems solved at each iteration, speeding up the solution; (2) a new robust scheme for reconstructing the 2D coordinates from the angle space solution that avoids the numerical instabilities which hindered the ABF reconstruction scheme; and (3) an efficient hierarchical solution technique. The speedup with (1) does not come at the expense of greater distortion. The hierarchical technique (3) enables parameterization of models with millions of faces in seconds at the expense of a minor increase in parametric distortion. The parameterization computed by ABF++ are provably valid, that is they contain no flipped triangles. As a result of these extensions, the ABF++ method is extremely suitable for robustly and efficiently parameterizing models for geometry-processing applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
Degener, P., Meseth, J., and Klein, R. 2003. An adaptable surface parametrization method. In 12th International Meshing Roundtable. 201--213.
 
4
 
5
Desbrun, M., Meyer, M., and Alliez, P. 2002. Intrinsic parameterizations of surface meshes. In Proceedings of Eurographics. 209--218.
6
 
7
 
8
 
9
Floater, M. S. and Hormann, K. 2004. Surface parameterization: A tutorial and survey. In Advances on Multiresolution in Geometric Modelling. M. S. F. N. Dodgson and M. Sabin, Eds. Springer-Verlag, Heidelberg.
 
10
Graphite. 2003. http://www.loria.fr/levy/Graphite/index.html.
11
 
12
Gu, X. and Yau, S.-T. 2002. Computing conformal structures of surfaces. Comm. Inform. Syst. 2, 121--146.
 
13
Hormann, K. 2001. Theory and applications of parameterizing triangulations. Ph.D. thesis, Department of Computer Science, University of Erlangen.
 
14
Hormann, K. and Greiner, G. 2000. MIPS: An efficient global parametrization method. In Curve and Surface Design: Saint Malo 1999. P.-J. Laurent, P. Sablonniëre, and L. Schumaker, Eds. Vanderbilt University Press, 153--162.
15
16
 
17
Lévy, B., Petitjean, S., Ray, N., and Maillot, J. 2002. Least squares conformal maps. ACM Trans. Graph. (SIGGRAPH). 362--371.
 
18
Lévy, B., Petitjean, S., Ray, N., and Maillot, J. 2003. http://www.loria.fr/levy/erratum.html.
 
19
Liesen, J., de Sturler, E., Sheffer, A., Aydin, Y., and Siefert, C. 2001. Preconditioners for indefinite linear systems arising in surface parameterization. In Proceedings of the 11th International Meshing Roundtable. 71--81.
 
20
21
 
22
Mogilnitsky, M. 2004. Efficient, low distortion, conformal parameterization of large meshes. MS thesis, Technion.
 
23
Nocedal and Wright. 2000. Numerical Optimization. Springer.
 
24
Pinkall, U. and Polthier, K. 1993. Computing discrete minimal surfaces and their conjugates. Experiment. Math. 2, 15.
25
 
26
 
27
28
 
29
Sheffer, A. and de Sturler, E. 2001. Parameterization of faceted surfaces for meshing using angle based flattening. Engin. Comput. 17, 326--337.
 
30
 
31
 
32
Strang, G. 1988. Linear Algebra and Its Applications. 3rd Ed., Harcourt Brace Jovanovich, San Diego.
33
 
34
Tutte, W. 1960. Convex representation of graphs. In Proceedings of the London Mathematical Society Vol. 10.
 
35
 
36
Zayer, R., Roessl, C., and Seidel, H. P. 2004. Variations on angle based flattening. Proceedings of Mingle Workshop.

CITED BY  30

Collaborative Colleagues:
Alla Sheffer: colleagues
Bruno Lévy: colleagues
Maxim Mogilnitsky: colleagues
Alexander Bogomyakov: colleagues