/**********************************************************************
* try_point_pairs
*
* Try all the splits that are produced by pairing critical points
* together. See if any of them are suitable for use. Use a seam
* queue and seam pile that have already been initialized and used.
**********************************************************************/
void Wordrec::try_point_pairs(EDGEPT * points[MAX_NUM_POINTS],
inT16 num_points,
SeamQueue* seam_queue,
SeamPile* seam_pile,
SEAM ** seam,
TBLOB * blob) {
inT16 x;
inT16 y;
PRIORITY priority;
for (x = 0; x < num_points; x++) {
for (y = x + 1; y < num_points; y++) {
if (points[y] &&
points[x]->WeightedDistance(*points[y], chop_x_y_weight) <
chop_split_length &&
points[x] != points[y]->next && points[y] != points[x]->next &&
!is_exterior_point(points[x], points[y]) &&
!is_exterior_point(points[y], points[x])) {
SPLIT split(points[x], points[y]);
priority = partial_split_priority(&split);
choose_best_seam(seam_queue, &split, priority, seam, blob, seam_pile);
}
}
}
}
/**
* @name pick_close_point
*
* Choose the edge point that is closest to the critical point. This
* point may not be exactly vertical from the critical point.
*/
EDGEPT *Wordrec::pick_close_point(EDGEPT *critical_point,
EDGEPT *vertical_point,
int *best_dist) {
EDGEPT *best_point = nullptr;
int this_distance;
int found_better;
do {
found_better = false;
this_distance = edgept_dist (critical_point, vertical_point);
if (this_distance <= *best_dist) {
if (!(same_point (critical_point->pos, vertical_point->pos) ||
same_point (critical_point->pos, vertical_point->next->pos) ||
(best_point && same_point (best_point->pos, vertical_point->pos)) ||
is_exterior_point (critical_point, vertical_point))) {
*best_dist = this_distance;
best_point = vertical_point;
if (chop_vertical_creep)
found_better = true;
}
}
vertical_point = vertical_point->next;
}
while (found_better == true);
return (best_point);
}