A Homotopy Surface Cutting using Paths Crossing in Geodesic Distance

Anuwat Dechvijankit, Hiroshi Nagahashi, Kota Aoki

2015

Abstract

Topology is a property of surfaces that plays a major role in computer graphics. Processing or analysis between two surfaces generally requires both of them to be in same topology. There are many tools or applications such as parameterization or remeshing that require disk topology surfaces as input. Therefore, it is important to convert any surfaces to be same as a topological disk. The common procedure is to define a graph of edges inside the surface that should be split into two edges and to turn the surface into topological disk. We call it as homotopy cutting. Problems become more difficult when dealing with high genus surfaces such as a torus. Based on a novel method, we present an enhancement method to generate a cut graph in high-genus surface for homotopy cutting. By using geodesic properties of each edge, we can generate equally or more suitable edge-graph than original method while keeping similar performance and stability as original one.

References

  1. Bennis, C., Vézien, J.-M., and Iglésias, G. (1991). Piecewise surface flattening for non-distorted texture mapping. SIGGRAPH Comput. Graph., 25(4):237-246.
  2. Cohen, J., Olano, M., and Manocha, D. (1998). Appearance-preserving simplification. In Proceedings of the 25th annual conference on Computer graphics and interactive techniques, SIGGRAPH 7898, pages 115-122, New York, NY, USA. ACM.
  3. Dey, T. K. (1994). A new technique to compute polygonal schema for 2-manifolds with application to nullhomotopy detection. In Proceedings of the Tenth Annual Symposium on Computational Geometry, SCG 7894, pages 277-284, New York, NY, USA. ACM.
  4. Dey, T. K., Fan, F., and Wang, Y. (2013). An efficient computation of handle and tunnel loops via reeb graphs. ACM Trans. Graph., 32(4):32:1-32:10.
  5. Dey, T. K., Li, K., Sun, J., and Cohen-Steiner, D. (2008). Computing geometry-aware handle and tunnel loops in 3d models. ACM Trans. Graph., 27(3):45:1-45:9.
  6. Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. NUMERISCHE MATHEMATIK, 1(1):269-271.
  7. Erickson, J. and Har-Peled, S. (2002). Optimally cutting a surface into a disk. In Proceedings of the eighteenth annual symposium on Computational geometry, SCG 7802, pages 244-253, New York, NY, USA. ACM.
  8. Erickson, J. and Whittlesey, K. (2005). Greedy optimal homotopy and homology generators. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 7805, pages 1038-1046, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics.
  9. Floater, M. S. (1997). Parametrization and smooth approximation of surface triangulations. Comput. Aided Geom. Des., 14:231-250.
  10. Gu, X., Gortler, S. J., and Hoppe, H. (2002). Geometry images. ACM Trans. Graph., 21(3):355-361.
  11. Hormann, K. and Greiner, G. (2000). Quadrilateral remeshing. In Proceedings of Vision, Modeling and Vizualization, 2000, pages 153-162.
  12. Jin, M., Ding, N., and Yang, Y. (2013). Computing shortest homotopic cycles on polyhedral surfaces with hyperbolic uniformization metric. Comput. Aided Des., 45(2):113-123.
  13. Kutz, M. (2006). Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. In Proceedings of the Twenty-second Annual Symposium on Computational Geometry, SCG 7806, pages 430-438, New York, NY, USA. ACM.
  14. Mitchell, J. S. B., Mount, D. M., and Papadimitriou, C. H. (1987). The discrete geodesic problem. SIAM J. Comput., 16(4):647-668.
  15. Patanè, G., Spagnuolo, M., and Falcidieno, B. (2007). Families of cut-graphs for bordered meshes with arbitrary genus. Graph. Models, 69(2):119-138.
  16. Sander, P. V., Gortler, S. J., Snyder, J., and Hoppe, H. (2002). Signal-specialized parametrization. In Proceedings of the 13th Eurographics workshop on Rendering, EGRW 7802, pages 87-98, Aire-la-Ville, Switzerland, Switzerland. Eurographics Association.
  17. Sander, P. V., Snyder, J., Gortler, S. J., and Hoppe, H. (2001). Texture mapping progressive meshes. In Proceedings of the 28th annual conference on Computer graphics and interactive techniques, SIGGRAPH 7801, pages 409-416, New York, NY, USA. ACM.
  18. Surazhsky, V., Surazhsky, T., Kirsanov, D., Gortler, S. J., and Hoppe, H. (2005). Fast exact and approximate geodesics on meshes. ACM Trans. Graph., 24(3):553- 560.
  19. Tutte, W. T. (1963). How to draw a graph. Proceedings of The London Mathematical Society, s3-13:743-767.
  20. Yoshizawa, S., Belyaev, A., and Seidel, H.-P. (2004). A fast and simple stretch-minimizing mesh parameterization. In SMI 7804: Proceedings of the Shape Modeling International 2004, pages 200-208, Washington, DC, USA. IEEE Computer Society.
Download


Paper Citation


in Harvard Style

Dechvijankit A., Nagahashi H. and Aoki K. (2015). A Homotopy Surface Cutting using Paths Crossing in Geodesic Distance . In Proceedings of the 10th International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2015) ISBN 978-989-758-087-1, pages 130-137. DOI: 10.5220/0005302601300137


in Bibtex Style

@conference{grapp15,
author={Anuwat Dechvijankit and Hiroshi Nagahashi and Kota Aoki},
title={A Homotopy Surface Cutting using Paths Crossing in Geodesic Distance},
booktitle={Proceedings of the 10th International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2015)},
year={2015},
pages={130-137},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005302601300137},
isbn={978-989-758-087-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 10th International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2015)
TI - A Homotopy Surface Cutting using Paths Crossing in Geodesic Distance
SN - 978-989-758-087-1
AU - Dechvijankit A.
AU - Nagahashi H.
AU - Aoki K.
PY - 2015
SP - 130
EP - 137
DO - 10.5220/0005302601300137