A Deterministic O(m log m) Time Algorithm for the Reeb Graph

Discrete and Computational Geometry

Volumn 49, Issue 4, 2013, Pages 864-878

  Parsa, Salman ^a  

^a DUKE UNIVERSITY   (United States)

Author keywords

Algorithms; Graph connectivity; PL topology; Reeb graph

Indexed keywords

EID: 84879321299     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-013-9511-3     Document Type: Article

References (32)

1. Acar, U. A., Blelloch, G. E., Harper, R., Vittes, J. L., Woo, S. L. M.: Dynamizing static algorithms, with applications to dynamic trees and history independence. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete algorithms, SODA '04, pp. 531-540. Society for Industrial and Applied Mathematics, Philadelphia (2004).
2. Alstrup, S., Holm, J., Lichtenberg, K. D., Thorup, M.: Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms 1, 243-264 (2005).
3. Aujay, G., Hétroy, F., Lazarus, F., Depraz, C.: Harmonic skeleton for realistic character animation. In: Proceedings of the 2007 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, SCA '07, pp. 151-160. Eurographics Association, Aire-la-Ville (2007).
4. Bespalov, D., Regli, W. C., Shokoufandeh, A.: Reeb graph based shape retrieval for CAD. ASME Conf. Proc. 2003(36991), 229-238 (2003).
5. Biasotti, S., De Floriani, L., Falcidieno, B., Frosini, P., Giorgi, D., Landi, C., Papaleo, L., Spagnuolo, M.: Describing shapes by geometrical-topological properties of real functions. ACM Comput. Surv. 40(4), 12: 1-12: 87 (2008).
6. Biasotti, S., Giorgi, D., Spagnuolo, M., Falcidieno, B.: Reeb graphs for shape analysis and applications. Theor. Comput. Sci. 392(1-3), 5-22 (2008).
7. Carr, H., Snoeyink, J., Axen, U.: Computing contour trees in all dimensions. Comput. Geom. 24(2), 75-94 (2003).
8. Cole-McLaughlin, K., Edelsbrunner, H., Harer, J., Natarajan, V., Pascucci, V.: Loops in Reeb graphs of 2-manifolds. In: Proceedings of the Nineteenth Annual Symposium on Computational Geometry, SCG '03, pp. 344-350. ACM, New York (2003).
9. Dey, T. K., Wang, Y.: Reeb graphs: approximation and persistence. In: Proceedings of the 27th Annual ACM Symposium on Computational Geometry, SoCG '11, pp. 226-235. ACM, New York (2011).
10. Doraiswamy, H., Natarajan, V.: Efficient algorithms for computing Reeb graphs. Comput. Geom. 42(6-7), 606-616 (2009).
11. Edelsbrunner, H., Harer, J., Mascarenhas, A., Pascucci, V., Snoeyink, J.: Time-varying Reeb graphs for continuous space-time data. Comput. Geom. 41(3), 149-166 (2008).
12. Edelsbrunner, H., Harer, J., Patel, A. K.: Reeb spaces of piecewise linear mappings. In: Proceedings of the Twenty-fourth Annual Symposium on Computational Geometry, SCG '08, pp. 242-250. ACM, New York (2008).
13. Eppstein, D.: Offline algorithms for dynamic minimum spanning tree problems. J. Algorithms 17(2), 237-250 (1994).
14. Fujishiro, I., Takeshima, Y., Azuma, T., Takahashi, S.: Volume data mining using 3D field topology analysis. IEEE Comput. Graph. Appl. 20, 46-51 (2000).
15. Harvey, W., Wang, Y., Wenger, R.: A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes. In: Proceedings of the 2010 Annual Symposium on Computational Geometry, SoCG '10, pp. 267-276. ACM, New York (2010).
16. Hilaga, M., Shinagawa, Y., Kohmura, T., Kunii, T. L.: Topology matching for fully automatic similarity estimation of 3D shapes. In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH '01, pp. 203-212. ACM, New York (2001).
17. Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48, 723-760 (2001).
18. Kanongchaiyos, P., Shinagawa, Y.: Articulated Reeb Graphs for Interactive Skeleton Animation. Modeling: Modeling Multimedia Information and System, Nagano (2000).
19. Natali, M., Biasotti, S., Patane, G., Falcidieno, B.: Graph-based representations of point clouds. Graph. Models 73(5), 151-164 (2011).
20. Pascucci, V., Scorzelli, G., Bremer, P.-T., Mascarenhas, A.: Robust on-line computation of Reeb graphs: simplicity and speed. ACM Trans. Graph. 26, 58 (2007).
21. Patrascu, M., Demaine, E. D.: Logarithmic lower bounds in the cell-probe model. SIAM J. Comput. 35, 932-963 (2006).
22. Rekleitis, I., Lee-Shue, V., Choset, H.: Limited communication, multi-robot team based coverage. In: Proceedings of the 2004 IEEE International Conference on Robotics and Automation ICRA 04 2004, vol. 4, pp. 3462-3468 (2004).
23. Shi, Y., Lai, R., Krishna, S., Sicotte, N., Dinov, I., Toga, A. W.: Anisotropic Laplace-Beltrami eigenmaps: bridging Reeb graphs and skeletons. In: Computer Vision and Pattern Recognition Workshop, pp. 1-7. IEEE Computer Society, Anchorage (2008).
24. Shinagawa, Y., Kunii, T. L.: Constructing a Reeb graph automatically from cross sections. IEEE Comput. Graph. Appl. 11, 44-51 (1991).
25. Sleator, D. D., Tarjan, R. E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362-391 (1983).
26. Sleator, D. D., Tarjan, R. E.: Self-adjusting binary search trees. J. ACM 32, 652-686 (1985).
27. Tarjan, R. E., Werneck, R. F.: Self-adjusting top trees. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '05, pp. 813-822. Society for Industrial and Applied Mathematics, Philadelphia (2005).
28. Tarjan, R. E., Werneck, R. F.: Dynamic trees in practice. J. Exp. Algorithmics 14, 5: 4. 5-5: 4. 23 (2010).
29. Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, STOC '00, pp. 343-350. ACM, New York (2000).
30. Tierny, J., Gyulassy, A., Simon, E., Pascucci, V.: Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees. IEEE Trans. Vis. Comput. Graph. 15, 1177-1184 (2009).
31. Tung, T., Schmitt, F.: The augmented multiresolution Reeb graph approach for content-based retrieval of 3D shapes. Int. J. Shape Model. 11(1), 91-120 (2005).
32. Wood, Z., Hoppe, H., Desbrun, M., Schröder, P.: Removing excess topology from isosurfaces. ACM Trans. Graph. 23, 190-208 (2004).