|
Space-efficient geometric algorithms and data structuresBy Ilya Katz and Hervé Brönnimann |
| beap.hpp [code] | Several functions are provided for creation and manipulation of an interesting data structure called bi-parental heap, or beap. In short, in this data structure inner elements have two parents that are both larger than the element |
| beap_set.hpp [code] | |
| dynamic_sorted_vector.hpp [code] | This is a dynamic version of the a sorted vector. It supports insertion and deletion. Dynamic operations are accomplished in good amortized time by using the decomposition principle |
Code Documentation generated Using Doxygen
Copyright © Ilya Katz and Hervé Brönnimann, 2005, 2006.