Template Class BucketPrioQueue

Class Documentation

template<typename T>
class BucketPrioQueue

Priority queue for integer coordinates with squared distances as priority.

dynamicEDT3D: A library for incrementally updatable Euclidean distance transforms in 3D.

See also

http://octomap.sourceforge.net/ License: New BSD License A priority queue that uses buckets to group elements with the same priority. The individual buckets are unsorted, which increases efficiency if these groups are large. The elements are assumed to be integer coordinates, and the priorities are assumed to be squared euclidean distances (integers).

Author

C. Sprunk, B. Lau, W. Burgard, University of Freiburg, Copyright (C) 2011.

Public Functions

BucketPrioQueue()

Standard constructor.

Standard constructor. When called for the first time it creates a look up table that maps square distanes to bucket numbers, which might take some time…

dynamicEDT3D: A library for incrementally updatable Euclidean distance transforms in 3D.

See also

http://octomap.sourceforge.net/ License: New BSD License

Author

C. Sprunk, B. Lau, W. Burgard, University of Freiburg, Copyright (C) 2011.

inline void clear()
bool empty()

Checks whether the Queue is empty.

void push(int prio, T t)

push an element

T pop()

return and pop the element with the lowest squared distance */

inline int size()
inline int getNumBuckets()