Main Page   Class Hierarchy   Compound List   File List   Compound Members   File Members  

equivalent_cleaning Class Reference

#include <equivalent_cleaning.hh>

Inheritance diagram for equivalent_cleaning:

Inheritance graph
[legend]
Collaboration diagram for equivalent_cleaning:

Collaboration graph
[legend]
List of all members.

Public Methods

 equivalent_cleaning (const vertex_data_color &v, const border_data_deriche &b)
 Constructor.

bool lambda (int, vertex, vertex, dart, dart)
 Function to know if the two vertices must be merged.

double value (vertex)
double interest (int, vertex, vertex, dart, dart)

Detailed Description

Model class used to determine and remove all the small vertices


Constructor & Destructor Documentation

equivalent_cleaning::equivalent_cleaning const vertex_data_color   v,
const border_data_deriche   b
[inline]
 

Constructor.


Member Function Documentation

double equivalent_cleaning::interest int   ,
vertex   ,
vertex   ,
dart   ,
dart   
[virtual]
 

Function to compute the merging interset of between two vertices That will be minimized during the reduction process

Implements equivalent_mont_jolion.

bool equivalent_cleaning::lambda int   ,
vertex   ,
vertex   ,
dart   ,
dart   
[virtual]
 

Function to know if the two vertices must be merged.

Implements equivalent_mont_jolion.

double equivalent_cleaning::value vertex    [virtual]
 

Function to compute the surviving criterion of a vertex That will be minimized during the reduction process

Implements equivalent_mont_jolion.


The documentation for this class was generated from the following files:
Generated on Tue Jun 24 14:58:48 2003 for Combinatorial Pyramids by doxygen1.2.18