Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann

explicit_tree_heap.hpp File Reference

Detailed Description

This file creates the tree/heap data structure that uses pointers and thus occupies extra space.

The data structure follows tree_heap interface

Code Documentation generated Using Doxygen


Namespaces
namespace	inplaceds
Data Structures
class	inplaceds::explicit_tree_node< Geometry >
class	inplaceds::explicit_tree_heap< Geometry, BSTCompare, PQCompare >
struct	inplaceds::explicit_tree_heap< Geometry, BSTCompare, PQCompare >::BST_Data
Functions
template<typename Geometry>
std::ostream &	inplaceds::operator<< (std::ostream &os, inplaceds::explicit_tree_node< Geometry > &node)