{"title":"Loops in Reeb graphs of 2-manifolds","citation":{"ama":"Cole Mclaughlin K, Edelsbrunner H, Harer J, Natarajan V, Pascucci V. Loops in Reeb graphs of 2-manifolds. <i>Discrete &#38; Computational Geometry</i>. 2004;32(2):231-244. doi:<a href=\"https://doi.org/10.1007/s00454-004-1122-6\">10.1007/s00454-004-1122-6</a>","ista":"Cole Mclaughlin K, Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2004. Loops in Reeb graphs of 2-manifolds. Discrete &#38; Computational Geometry. 32(2), 231–244.","short":"K. Cole Mclaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, V. Pascucci, Discrete &#38; Computational Geometry 32 (2004) 231–244.","apa":"Cole Mclaughlin, K., Edelsbrunner, H., Harer, J., Natarajan, V., &#38; Pascucci, V. (2004). Loops in Reeb graphs of 2-manifolds. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-004-1122-6\">https://doi.org/10.1007/s00454-004-1122-6</a>","mla":"Cole Mclaughlin, Kree, et al. “Loops in Reeb Graphs of 2-Manifolds.” <i>Discrete &#38; Computational Geometry</i>, vol. 32, no. 2, Springer, 2004, pp. 231–44, doi:<a href=\"https://doi.org/10.1007/s00454-004-1122-6\">10.1007/s00454-004-1122-6</a>.","ieee":"K. Cole Mclaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, “Loops in Reeb graphs of 2-manifolds,” <i>Discrete &#38; Computational Geometry</i>, vol. 32, no. 2. Springer, pp. 231–244, 2004.","chicago":"Cole Mclaughlin, Kree, Herbert Edelsbrunner, John Harer, Vijay Natarajan, and Valerio Pascucci. “Loops in Reeb Graphs of 2-Manifolds.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2004. <a href=\"https://doi.org/10.1007/s00454-004-1122-6\">https://doi.org/10.1007/s00454-004-1122-6</a>."},"quality_controlled":0,"date_updated":"2021-01-12T07:53:39Z","publication":"Discrete & Computational Geometry","intvolume":"        32","status":"public","_id":"3985","type":"journal_article","year":"2004","acknowledgement":"Partially supported by NSF under Grants EIA-99-72879 and CCR-00-86013.","publisher":"Springer","publist_id":"2140","author":[{"last_name":"Cole Mclaughlin","first_name":"Kree","full_name":"Cole-McLaughlin, Kree"},{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Herbert Edelsbrunner"},{"full_name":"Harer, John","first_name":"John","last_name":"Harer"},{"full_name":"Natarajan, Vijay","last_name":"Natarajan","first_name":"Vijay"},{"last_name":"Pascucci","first_name":"Valerio","full_name":"Pascucci, Valerio"}],"month":"07","volume":32,"page":"231 - 244","day":"01","publication_status":"published","date_published":"2004-07-01T00:00:00Z","doi":"10.1007/s00454-004-1122-6","date_created":"2018-12-11T12:06:16Z","extern":1,"abstract":[{"lang":"eng","text":"Given a Morse function f over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight upper and lower bounds on the number of loops in the Reeb graph that depend on the genus, the number of boundary components, and whether or not the 2-manifold is orientable. We also give an algorithm that constructs the Reeb graph in time O(n log n), where n is the number of edges in the triangulation used to represent the 2-manifold and the Morse function."}],"issue":"2"}