h o m e d o c u m e n t a t i o n c l a s s h i e r a r c h y

ChainSilhouetteIterator Class Reference

#include <ChainingIterators.h>

Inheritance diagram for ChainSilhouetteIterator:

ChainingIterator ViewEdgeIterator List of all members.

Detailed Description

A ViewEdge Iterator used to follow ViewEdges the most naturally. For example, it will follow visible ViewEdges of same nature. As soon, as the nature or the visibility changes, the iteration stops (by setting the pointed ViewEdge to 0). In the case of an iteration over a set of ViewEdge that are both Silhouette and Crease, there will be a precedence of the silhouette over the crease criterion.


Public Member Functions

 ChainSilhouetteIterator (bool iRestrictToSelection=true, ViewEdge *begin=NULL, bool orientation=true)
 ChainSilhouetteIterator (const ChainSilhouetteIterator &brother)
virtual string getExactTypeName () const
virtual ViewEdge * traverse (const AdjacencyIterator &it)

Constructor & Destructor Documentation

ChainSilhouetteIterator (  bool  iRestrictToSelection = true,
ViewEdge *  begin = NULL,
bool  orientation = true
)  [inline]
 

Builds a ChainSilhouetteIterator from the first ViewEdge used for iteration and its orientation.

Parameters:
iRestrictToSelection Indicates whether to force the chaining to stay within the set of selected ViewEdges or not.
begin The ViewEdge from where to start the iteration.
orientation If true, we'll look for the next ViewEdge among the ViewEdges that surround the ending ViewVertex of begin. If false, we'll search over the ViewEdges surrounding the ending ViewVertex of begin.

ChainSilhouetteIterator (  const ChainSilhouetteIterator &  brother  )  [inline]
 

Copy constructor

Member Function Documentation

virtual string getExactTypeName (   )  const [inline, virtual]
 

Returns the string "ChainSilhouetteIterator"

Reimplemented from ChainingIterator.

virtual ViewEdge* traverse (  const AdjacencyIterator &  it  )  [virtual]
 

This method iterates over the potential next ViewEdges and returns the one that will be followed next. When reaching the end of a chain, 0 is returned.

Reimplemented from ChainingIterator.

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