#include <TreatCMatching.hpp>
Public Member Functions | |
CMatch () | |
~CMatch () | |
deque< OGraphic * > | match (deque< OHL * > &ha, double) |
Protected Member Functions | |
bool | isLineLoop (OHL *) |
void | closeLoop (OHL *) |
void | match () |
void | findMatching () |
bool | toMatch (OLine &, OLine &) |
void | matching (int, int) |
double | gapStroke (OLine &, OLine &) |
void | dualMatchingFilter () |
void | strokeFilter () |
void | fuzzySort () |
void | performMatching () |
void | printTabMatching () |
void | printMatching (int) |
Protected Attributes | |
double | th |
deque< OLine * > | la |
deque< Matching > | ms |
deque< OGraphic * > | pa |
|
Constructor |
|
Destructor |
|
Close the loop, the begin and end point are equals |
|
Erase the dual matching objects |
|
Find all possible matchings |
|
Fuzzy sort of matching objects |
|
Compute a matching between lines mean and middles distances, so this criterion is a gap search of strocke pattern 'I' |
|
Test if OHL is a line loop, is it composed of OLine is it large (4 OLine min) is it closed (the begin point is near end point (so connected) |
|
Match a OHL of OHL object be sure to use parse function before |
|
Match an OHL |
|
Compute the range matching, and crealte a matching object |
|
Perform matching |
|
Print tab matching |
|
Print tab matching |
|
Stroke filter |
|
Test if two lines can be match, they are no connected, opposite, and overlaped |
|
|
|
|
|
|
|
|