Salman Parsa. o(m log m) time algorithm for the reeb graph. In Tamal K. Dey, Sue Whitesides, editors, Symposuim on Computational Geometry 2012, SoCG '12, Chapel Hill, NC, USA, June 17-20, 2012. pages 269-276, ACM, 2012. [doi]
@inproceedings{Parsa12,
title = {o(m log m) time algorithm for the reeb graph},
author = {Salman Parsa},
year = {2012},
doi = {10.1145/2261250.2261289},
url = {http://doi.acm.org/10.1145/2261250.2261289},
researchr = {https://researchr.org/publication/Parsa12},
cites = {0},
citedby = {0},
pages = {269-276},
booktitle = {Symposuim on Computational Geometry 2012, SoCG '12, Chapel Hill, NC, USA, June 17-20, 2012},
editor = {Tamal K. Dey and Sue Whitesides},
publisher = {ACM},
isbn = {978-1-4503-1299-8},
}