---

CHierarchicalQueue Class Reference

A hierarchical queue of pixels. More...

#include <HierarchicalQueue.h>

Inheritance diagram for CHierarchicalQueue

[legend]Collaboration diagram for CHierarchicalQueue:

[legend]List of all members.

Public Methods
	CHierarchicalQueue (int sizeQueue=256)
	~CHierarchicalQueue ()
bool	empty ()
	Check if the queue is empty.
void	first (LPPIXEL *p)
	Get the first pixel of the queue in 4 or 8 connectivity.
void	first (LPPIXEL *p, short *parity)
	Get the first pixel of the queue in 6 connectivity.
void	add (LPPIXEL p)
	Adding a pixel to the queue in 4 or 8 connectivity.
void	add (LPPIXEL p, short parity)
	Adding a pixel to the queue in 6 connectivity.
void	invert ()
	invert the queue (not always possible).
Private Attributes
int	size
deque<LPPIXEL>*	hQueue
deque<short>*	hQparity
deque<LPPIXEL>	priorityQueue
deque<short>	priorityQueueParity
PIXEL	currentLevel

---

Detailed Description

A hierarchical queue of pixels.

Author(s):

Laurent Najman

Date:

8/26/01

Keywords:

Queue

Version:

Id: HierarchicalQueue.h,v 1.1 2001/08/28 21:56:16 laurentnajman Exp

Content:

An implementation of hierarchical queue for use in morphological algorithm. A pixel is put into an array of queue according to its value. Based on F. Meyer: "Un Algorithme Optimal de Ligne de Partage des Eaux". If the current immersion level is greater than the value of the current pixel, it is put in a special prioritary queue.

---

The documentation for this class was generated from the following file:

• HierarchicalQueue.h

---