HIGHLIGHTS
- who: Algorithm, and Benjamin, Raichel from the Department of Computer Science, University of Texas at Dallas, Richardson, USA have published the Article: Avoiding the Global Sort: A Faster Contour Tree Algorithm, in the Journal: (JOURNAL)
- what: Can the authors beat this sorting bound for certain instances, and can the authors characterize which inputs are hard?
- future: In each recursive call the direction of rain is switched to the opposite direction.
SUMMARY
The final contour tree is basically two binary trees joined at their roots, and the authors do not . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.