“Large-scale bounded distortion mappings” – ACM SIGGRAPH HISTORY ARCHIVES

“Large-scale bounded distortion mappings”

  • 2015 SA Technical Papers_Kovalsky_Large-Scale Bounded Distortion Mappings

Conference:


Type(s):


Title:

    Large-scale bounded distortion mappings

Session/Category Title:

    Mappings and Parameterizations

Presenter(s)/Author(s):



Abstract:


    We propose an efficient algorithm for computing large-scale bounded distortion maps of triangular and tetrahedral meshes. Specifically, given an initial map, we compute a similar map whose differentials are orientation preserving and have bounded condition number.Inspired by alternating optimization and Gauss-Newton approaches, we devise a first order method which combines the advantages of both. On the one hand, its iterations are as computationally efficient as those of alternating optimization. On the other hand, it enjoys preferable convergence properties, associated with Gauss-Newton like approaches.We demonstrate the utility of the proposed approach in efficiently solving geometry processing problems, focusing on challenging large-scale problems.

References:


    1. Aigerman, N., and Lipman, Y. 2013. Injective and bounded distortion mappings in 3d. ACM Trans. Graph. 32, 4, 106–120.
    2. Anguelov, D., Srinivasan, P., Koller, D., Thrun, S., Rodgers, J., and Davis, J. 2005. Scape: Shape completion and animation of people. ACM Trans. Graph. 24, 3, 408–416.
    3. Balzer, J., and Soatto, S. 2014. Second-order shape optimization for geometric inverse problems in vision. In Computer Vision and Pattern Recognition (CVPR), 2014 IEEE Conference on, IEEE, 3850–3857.
    4. Bouaziz, S., Deuss, M., Schwartzburg, Y., Weise, T., and Pauly, M. 2012. Shape-up: Shaping discrete geometry with projections. In Computer Graphics Forum, vol. 31, Wiley Online Library, 1657–1667.
    5. Boyd, S., and Vandenberghe, L. 2004. Convex Optimization. Cambridge University Press, New York, NY, USA.
    6. Chao, I., Pinkall, U., Sanan, P., and Schröder, P. 2010. A simple geometric model for elastic deformations. ACM Trans. Graph. 29, 4, 38.
    7. Giorgi, D., Biasotti, S., and Paraboschi, L., 2007. Shape retrieval contest 2007: Watertight models track.
    8. Igarashi, T., Moscovich, T., and Hughes, J. F. 2005. As-rigid-as-possible shape manipulation. ACM Trans. Graph. 24, 3 (July), 1134–1141.
    9. Kovalsky, S. Z., Aigerman, N., Basri, R., and Lipman, Y. 2014. Controlling singular values with semidefinite programming. ACM Trans. Graph. 33, 4 (July), 68:1–68:13.
    10. Lange, K. 2013. Optimization (Springer Texts in Statistics), 2nd ed. 2013 ed. Springer, 3.
    11. Lévy, B., Petitjean, S., Ray, N., and Maillot, J. 2002. Least squares conformal maps for automatic texture atlas generation. ACM Trans. Graph. 21, 3 (July), 362–371.
    12. Lipman, Y. 2012. Bounded distortion mapping spaces for triangular meshes. ACM Trans. Graph. 31, 4, 108.
    13. Liu, L., Zhang, L., Xu, Y., Gotsman, C., and Gortler, S. J. 2008. A local/global approach to mesh parameterization. Proc. Eurographics Symposium on Geometry Processing 27, 5.
    14. Mullen, P., Tong, Y., Alliez, P., and Desbrun, M. 2008. Spectral conformal parameterization. In Computer Graphics Forum, vol. 27, Wiley Online Library, 1487–1494.
    15. Schüller, C., Kavan, L., Panozzo, D., and Sorkine-Hornung, O. 2013. Locally injective mappings. Proc. Eurographics Symposium on Geometry Processing 32, 5, 125–135.
    16. Sorkine, O., and Alexa, M. 2007. As-rigid-as-possible surface modeling. In Proc. Eurographics Symposium on Geometry Processing, 109–116.
    17. Tang, C., Sun, X., Gomes, A., Wallner, J., and Pottmann, H. 2014. Form-finding with polyhedral meshes made simple. ACM Trans. Graph. 33, 4, 70.
    18. Telea, A., and Van Wijk, J. J. 2002. An augmented fast marching method for computing skeletons and centerlines. In Proceedings of the symposium on Data Visualisation 2002, Eurographics Association.
    19. Wright, S. J., and Nocedal, J. 1999. Numerical optimization, vol. 2. Springer New York.


ACM Digital Library Publication:



Overview Page:



Submit a story:

If you would like to submit a story about this presentation, please contact us: historyarchives@siggraph.org