plabelmerging

Merges two regions from label value.

Synopsis

plabelmerging label1 label2 [rg_in|-] [gr_in|-] [rg_out|-] [gr_out|-]

Description

plabelmerging merges two regions specified by their label value. The regions of the output region map rg_out keep the same label than the regions in the input region map rg_in. The output graph gr_out is updated with the new node that results from the merging of the two nodes and also the list of neighbors. The new seed is located at the center of mass of the new region.

Parameters

label1 is the label of the first region in the input region map rg_in. It is an integer from 1 to maximum label value.
label2 is the label of the second region in the input region map rg_in. It is an integer from 1 to maximum label value.

Inputs

rg_in: a region map.
gr_in: a graph.

Outputs

rg_out: a region map.
gr_out: a graph.

Result

Returns SUCCESS or FAILURE.

Examples

Segments the tangram.pan with a quadtree technique and then merges label 1 and 2:

  puniformityquadtree 0.9 tangram.pan a.pan
  prg2gr a.pan b.pan
  plabelmerging  1 2 a.pan b.pan out1.pan out2.pan

C++ prototype

Errc PLabelMerging( const Reg2d &rg_in, cconst Graph2d &gr_in, Reg2d &rg_out Graph2d &gr_out, int label1, int label2 );

Version française

Fusion nominative de 2 régions.

Author: Régis Clouard